A regularized strong duality for nonsymmetric semidefinite least squares problem
From MaRDI portal
Publication:644518
DOI10.1007/s11590-010-0233-7zbMath1254.90150OpenAlexW1988265099MaRDI QIDQ644518
Ziyan Luo, Yingnan Wang, Nai-Hua 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
strong dualitynonsingularityconstraint nondegeneracyfacial reduction algorithmnonsymmetric semidefinite least squares
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Computing the nearest correlation matrix--a problem from finance
- On cone of nonsymmetric positive semidefinite matrices
- An inexact primal-dual path following algorithm for convex quadratic SDP
- Regularizing the abstract convex program
- Topics in semidefinite and interior-point methods
- An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem
- Local Duality of Nonlinear Semidefinite Programming
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- Strong Duality for Semidefinite Programming
- A Dual Approach to Semidefinite Least-Squares Problems
- A preconditioned Newton algorithm for the nearest correlation matrix
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- On the Closedness of the Linear Image of a Closed Convex Cone
- Least-Squares Covariance Matrix Adjustment
- Convex Analysis
- Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Best approximation in inner product spaces
