A Dual Approach to Semidefinite Least-Squares Problems

From MaRDI portal





In an Euclidean space, a projection is studied onto the intersection of an affine subspace and a closed convex set. A Lagrangian dualization of this least-squares problem is proposed. This leads to a convex differentiable problem, which can be solved with a quasi-Newton algorithm. The results are applied to the cone of positive semidefinite matrices. Such projection problems arise in portfolio risk analysis, see \textit{N. J. Higham} [IMA J. Numer. Anal. 22, No. 3, 329--343 (2002; Zbl 1006.65036)], and in robust quadratic optimization, see \textit{P. I. Davies} and \textit{N. J. Higham} [BIT 40, No. 4, 640--651 (2000; Zbl 0969.65036)]. Numerical experiments show that fairly large problems can be solved efficiently.




Cited in
(65)


Describes a project that uses

Uses Software






This page was built for publication: A Dual Approach to Semidefinite Least-Squares Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4650993)