Low rank approximation of the symmetric positive semidefinite matrix
From MaRDI portal
Publication:2511200
DOI10.1016/j.cam.2013.09.080zbMath1293.65070OpenAlexW2071738309MaRDI QIDQ2511200
Xue-Feng Duan, Qing-Wen Wang, Xinjun Zhang, Jiao-Fen Li
Publication date: 5 August 2014
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2013.09.080
unconstrained optimizationnonlinear conjugate gradient methodlow rank approximationfeasible setsymmetric positive semidefinite matrix
Numerical optimization and variational techniques (65K10) Positive matrices and their generalizations; cones of matrices (15B48)
Related Items
Novel alternating update method for low rank approximation of structured matrices, A novel method for a class of structured low-rank minimizations with equality constraint, Accelerated method for optimization over density matrices in quantum state estimation, Unfoldings and the rank-one approximation of the tensor
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the low-rank approximation by the pivoted Cholesky decomposition
- Low rank approximation. Algorithms, implementation, applications
- Structured low rank approximations of the sylvester resultant matrix for approximate GCDS of Bernstein basis polynomials
- Regularization by truncated Cholesky factorization: a comparison of four different approaches
- The truncated SVD as a method for regularization
- Critical points of matrix least squares distance functions
- Optimal low-rank approximation to a correlation matrix
- Structured low rank approximation
- Low rank approximation of a Hankel matrix by structured total least norm
- Structured low-rank approximation and its applications
- Structured total least norm and approximate GCDs of inexact polynomials
- 10.1162/153244303768966085
- Numerical Optimization
- An exact line search method for solving generalized continuous-time algebraic Riccati equations
- Real-Valued, Low Rank, Circulant Approximation
- Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
