The University of Southampton
University of Southampton Institutional Repository

An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem

An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem
An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem
Higham (2002, IMA J. Numer. Anal., 22, 329–343) considered two types of nearest correlation matrix problems, namely the W-weighted case and the H-weighted case. While the W-weighted case has since been well studied to make several Lagrangian dual-based efficient numerical methods available, the H-weighted case remains numerically challenging. The difficulty of extending those methods from the W-weighted case to the H-weighted case lies in the fact that an analytic formula for the metric projection onto the positive semidefinite cone under the H-weight, unlike the case under the W-weight, is not available. In this paper we introduce an augmented Lagrangian dual-based approach that avoids the explicit computation of the metric projection under the H-weight. This method solves a sequence of unconstrained convex optimization problems, each of which can be efficiently solved by an inexact semismooth Newton method combined with the conjugate gradient method. Numerical experiments demonstrate that the augmented Lagrangian dual approach is not only fast but also robust.
augmented lagrangian, semismooth newton method, conjugate gradient method, nearest correlation matrix
0272-4979
491-511
Qi, Houduo
e9789eb9-c2bc-4b63-9acb-c7e753cc9a85
Sun, Defeng
48acb796-0417-4d19-8be8-1739d44e50b0
Qi, Houduo
e9789eb9-c2bc-4b63-9acb-c7e753cc9a85
Sun, Defeng
48acb796-0417-4d19-8be8-1739d44e50b0

Qi, Houduo and Sun, Defeng (2011) An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem. IMA Journal of Numerical Analysis, 31, 491-511. (doi:10.1093/imanum/drp031).

Record type: Article

Abstract

Higham (2002, IMA J. Numer. Anal., 22, 329–343) considered two types of nearest correlation matrix problems, namely the W-weighted case and the H-weighted case. While the W-weighted case has since been well studied to make several Lagrangian dual-based efficient numerical methods available, the H-weighted case remains numerically challenging. The difficulty of extending those methods from the W-weighted case to the H-weighted case lies in the fact that an analytic formula for the metric projection onto the positive semidefinite cone under the H-weight, unlike the case under the W-weight, is not available. In this paper we introduce an augmented Lagrangian dual-based approach that avoids the explicit computation of the metric projection under the H-weight. This method solves a sequence of unconstrained convex optimization problems, each of which can be efficiently solved by an inexact semismooth Newton method combined with the conjugate gradient method. Numerical experiments demonstrate that the augmented Lagrangian dual approach is not only fast but also robust.

This record has no associated files available for download.

More information

Published date: 18 February 2011
Keywords: augmented lagrangian, semismooth newton method, conjugate gradient method, nearest correlation matrix
Organisations: Operational Research

Identifiers

Local EPrints ID: 145375
URI: http://eprints.soton.ac.uk/id/eprint/145375
ISSN: 0272-4979
PURE UUID: 666bd345-ecde-4a5c-b507-856e2d75a546
ORCID for Houduo Qi: ORCID iD orcid.org/0000-0003-3481-4814

Catalogue record

Date deposited: 19 Apr 2010 08:14
Last modified: 14 Mar 2024 02:49

Export record

Altmetrics

Contributors

Author: Houduo Qi ORCID iD
Author: Defeng Sun

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.

×