The University of Southampton
University of Southampton Institutional Repository

A sequential semismooth Newton method for the nearest low-rank correlation matrix problem

A sequential semismooth Newton method for the nearest low-rank correlation matrix problem
A sequential semismooth Newton method for the nearest low-rank correlation matrix problem
Based on the well known result that the sum of largest eigenvalues of a symmetric matrix can be represented as a semidefinite programming problem (SDP), we formulate the nearest low-rank correlation matrix problem as a nonconvex SDP and propose a numerical method that solves a sequence of least-square problems. Each of the least-square problems can be solved by a specifically designed semismooth Newton method, which is shown to be quadratically convergent.
The sequential method is guaranteed to produce a stationary point of the nonconvex SDP. Our numerical results demonstrate the high efficiency of the proposed method on large scale problems
1052-6234
1641-1666
Li, Qingna
a189d836-f8f0-407b-9983-0a73bf8a214a
Qi, Houduo
e9789eb9-c2bc-4b63-9acb-c7e753cc9a85
Li, Qingna
a189d836-f8f0-407b-9983-0a73bf8a214a
Qi, Houduo
e9789eb9-c2bc-4b63-9acb-c7e753cc9a85

Li, Qingna and Qi, Houduo (2011) A sequential semismooth Newton method for the nearest low-rank correlation matrix problem. SIAM Journal on Optimization, 21 (4), 1641-1666. (doi:10.1137/090771181).

Record type: Article

Abstract

Based on the well known result that the sum of largest eigenvalues of a symmetric matrix can be represented as a semidefinite programming problem (SDP), we formulate the nearest low-rank correlation matrix problem as a nonconvex SDP and propose a numerical method that solves a sequence of least-square problems. Each of the least-square problems can be solved by a specifically designed semismooth Newton method, which is shown to be quadratically convergent.
The sequential method is guaranteed to produce a stationary point of the nonconvex SDP. Our numerical results demonstrate the high efficiency of the proposed method on large scale problems

Text
77118.pdf - Version of Record
Restricted to Repository staff only
Request a copy

More information

Published date: 2011
Organisations: Operational Research

Identifiers

Local EPrints ID: 198597
URI: http://eprints.soton.ac.uk/id/eprint/198597
ISSN: 1052-6234
PURE UUID: 0e556f6a-8a61-48d9-9bfb-f3e321c0014b
ORCID for Houduo Qi: ORCID iD orcid.org/0000-0003-3481-4814

Catalogue record

Date deposited: 05 Oct 2011 10:21
Last modified: 15 Mar 2024 03:21

Export record

Altmetrics

Contributors

Author: Qingna Li
Author: Houduo Qi ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×