Minimum rank positive semidefinite solution to the matrix approximation problem in the spectral norm
From MaRDI portal
Publication:2186731
DOI10.1016/j.aml.2020.106408zbMath1442.15037OpenAlexW3017266878MaRDI QIDQ2186731
Publication date: 9 June 2020
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2020.106408
Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Miscellaneous inequalities involving matrices (15A45) Vector spaces, linear dependence, rank, lineability (15A03) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Related Items (2)
Norm-preserving dilation theorems for a block positive semidefinite (definite) matrix ⋮ Effective implementation to reduce execution time of a low-rank matrix approximation problem
Uses Software
Cites Work
- An approximation theory of matrix rank minimization and its application to quadratic equations
- Rank constrained matrix best approximation problem with respect to (skew) Hermitian matrices
- Low rank approximation. Algorithms, implementation, applications
- Rank constrained matrix best approximation problem
- Equalities and inequalities for inertias of Hermitian matrices with applications
- A generalization of the Eckart-Young-Mirsky matrix approximation theorem
- A note on the existence of the hyperbolic singular value decomposition
- Minimum rank Hermitian solution to the matrix approximation problem in the spectral norm and its application
- Least squares solutions to the rank-constrained matrix approximation problem in the Frobenius norm
- Software for weighted structured low-rank approximation
- Minimum rank (skew) Hermitian solutions to the matrix approximation problem in the spectral norm
- On generalized matrix approximation problem in the spectral norm
- On least squares solutions subject to a rank restriction
- On rank-constrained Hermitian nonnegative-definite least squares solutions to the matrix equationAXAH=B
- The Smallest Perturbation of a Submatrix which Lowers the Rank and Constrained Total Least Squares Problems
- Norm-Preserving Dilations and Their Applications to Optimal Error Bounds
- Minimum Rank Solutions to the Matrix Approximation Problems in the Spectral Norm
- Generalized Rank-Constrained Matrix Approximations
- Hermitian‐type generalized singular value decomposition with applications
This page was built for publication: Minimum rank positive semidefinite solution to the matrix approximation problem in the spectral norm
