A regularized strong duality for nonsymmetric semidefinite least squares problem

DOI10.1007/S11590-010-0233-7MaRDI QIDQ644518zbMATH OpenOpenAlexFDO

Authors Yingnan Wang, Ziyan Luo, Naihua Xiu

Publication date 4 November 2011

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-010-0233-7

zbMATH Keywords

strong dualitynonsingularityconstraint nondegeneracyfacial reduction algorithmnonsymmetric semidefinite least squares

Mathematics Subject Classification ID

Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• The conjugate duality of nonlinear semidefinite programming
• Solving nuclear norm regularized and semidefinite matrix least squares problems with linear equality constraints
• On the non-symmetric semidefinite Procrustes problem
• A Dual Approach to Semidefinite Least-Squares Problems
• On Regularized Least Norm Problems

Cites work

• scientific article; zbMATH DE number 1047682 (Why is no real title available?)
• scientific article; zbMATH DE number 2121575 (Why is no real title available?)
• A Dual Approach to Semidefinite Least-Squares Problems
• A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
• A preconditioned Newton algorithm for the nearest correlation matrix
• An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem
• An inexact primal-dual path following algorithm for convex quadratic SDP
• Best approximation in inner product spaces
• Computing the nearest correlation matrix--a problem from finance
• Convex Analysis
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Least-Squares Covariance Matrix Adjustment
• Local Duality of Nonlinear Semidefinite Programming
• On cone of nonsymmetric positive semidefinite matrices
• On the Closedness of the Linear Image of a Closed Convex Cone
• Regularizing the abstract convex program
• Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems
• Strong Duality for Semidefinite Programming
• The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
• Topics in semidefinite and interior-point methods

Cited in

(2)

• An alternating semiproximal method for nonconvex regularized structured total least squares problems
• \(\rho\)-regularization subproblems: strong duality and an eigensolver-based algorithm

Describes a project that uses

Uses Software

• QSDP

This page was built for publication: A regularized strong duality for nonsymmetric semidefinite least squares problem

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