Accuracy of approximate projection to the semidefinite cone
From MaRDI portal
Publication:2310414
DOI10.1016/j.laa.2020.02.014zbMath1436.65036arXiv1908.01606OpenAlexW3007105177WikidataQ120716810 ScholiaQ120716810MaRDI QIDQ2310414
Yuji Nakatsukasa, Nikitas Rontsis, Paul J. Goulart
Publication date: 6 April 2020
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.01606
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Semidefinite programming (90C22) Positive matrices and their generalizations; cones of matrices (15B48) Miscellaneous inequalities involving matrices (15A45)
Related Items
COSMO: a conic operator splitting method for convex conic problems, Efficient semidefinite programming with approximate ADMM, Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Computing the nearest correlation matrix--a problem from finance
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Restoring Definiteness via Shrinking, with an Application to Correlation Matrices with a Fixed Block
- Direct Methods for Sparse Matrices
- Numerical Methods for Large Eigenvalue Problems
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- Norm-Preserving Dilations and Their Applications to Optimal Error Bounds
- ARPACK Users' Guide
- A Dual Approach to Semidefinite Least-Squares Problems
- Semidefinite Programming
- Sharp error bounds for Ritz vectors and approximate singular vectors
- The Rotation of Eigenvectors by a Perturbation. III
- Convex analysis and monotone operator theory in Hilbert spaces
