Rank constrained matrix best approximation problem
From MaRDI portal
Publication:894411
DOI10.1016/j.aml.2015.06.009zbMath1330.90067OpenAlexW2191764240MaRDI QIDQ894411
Publication date: 30 November 2015
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2015.06.009
Quadratic programming (90C20) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60)
Related Items (6)
A regularized alternating least-squares method for minimizing a sum of squared Euclidean norms with rank constraint ⋮ Minimum rank positive semidefinite solution to the matrix approximation problem in the spectral norm ⋮ Effective implementation to reduce execution time of a low-rank matrix approximation problem ⋮ Rank constrained matrix best approximation problem with respect to (skew) Hermitian matrices ⋮ Minimum rank Hermitian solution to the matrix approximation problem in the spectral norm and its application ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Low rank approximation. Algorithms, implementation, applications
- Analysis and design of descriptor linear systems
- A generalization of the Eckart-Young-Mirsky matrix approximation theorem
- On extremal ranks and least squares solutions subject to a rank restriction
- Perturbation theory for the Eckart-Young-Mirsky theorem and the constrained total least squares problem
- Generalized inverses. Theory and applications.
- Software for weighted structured low-rank approximation
- On generalized matrix approximation problem in the spectral norm
- On least squares solutions subject to a rank restriction
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- The Smallest Perturbation of a Submatrix which Lowers the Rank and Constrained Total Least Squares Problems
- Minimum Rank Solutions to the Matrix Approximation Problems in the Spectral Norm
- Generalized Rank-Constrained Matrix Approximations
This page was built for publication: Rank constrained matrix best approximation problem
