A fixed-point method for approximate projection onto the positive semidefinite cone
Publication:2400246
DOI10.1016/j.laa.2017.02.014zbMath1372.65169OpenAlexW2595048582MaRDI QIDQ2400246
Douglas S. Gonçalves, Juliano B. Francisco
Publication date: 28 August 2017
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2017.02.014
semidefinite programmingnumerical experimentsprojectioniterative methodssymmetric matrixfixed-point methodpositive semidefinite conesparse symmetric banded matrices
Computational methods for sparse matrices (65F50) Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Hermitian, skew-Hermitian, and related matrices (15B57)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Computing a nearest symmetric positive semidefinite matrix
- On parallelizable eigensolvers
- The university of Florida sparse matrix collection
- Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions
- Some Recent Advances in Density Matrix Theory
- Semidefinite optimization
- Computing the Polar Decomposition—with Applications
- LAPACK Users' Guide
- A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
- A framework for symmetric band reduction
- Algorithm 807
- Matlab Guide
- Semidefinite Programming
- Functions of Matrices
- Some Iterative Methods for Improving Orthonormality
- An Iterative Algorithm for Computing the Best Estimate of an Orthogonal Matrix
This page was built for publication: A fixed-point method for approximate projection onto the positive semidefinite cone
