Generalized Rank-Constrained Matrix Approximations
From MaRDI portal
(Redirected from Publication:5301198)
Abstract: In this paper we give an explicit solution to the rank constrained matrix approximation in Frobenius norm, which is a generalization of the classical approximation of an m by n matrix A by a matrix of rank k at most.
Recommendations
- Least squares solutions to the rank-constrained matrix approximation problem in the Frobenius norm
- Rank constrained matrix best approximation problem
- On generalized matrix approximation problem in the spectral norm
- Rank constrained matrix best approximation problem with respect to (skew) Hermitian matrices
- scientific article; zbMATH DE number 3992802
Cited in
(45)- Towards theory of generic principal component analysis
- Hybrid CUR-type decomposition of tensors in the Tucker format
- 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
- A general class of arbitrary order iterative methods for computing generalized inverses
- 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
- Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm
- On generalized matrix approximation problem in the spectral norm
- Relations between least-squares and least-rank solutions of the matrix equation \(AXB=C\)
- Optimal regularized low rank inverse approximation
- Filtering and compression for infinite sets of stochastic signals
- Generic symmetric matrix pencils with bounded rank
- HOID: higher order interpolatory decomposition for tensors based on Tucker representation
- Efficient compression of distributed information in estimation fusion
- On least squares solutions subject to a rank restriction
- Online adaptive model reduction for nonlinear systems via low-rank updates
- Optimal low-rank approximations of Bayesian linear inverse problems
- On best rank \(n\) matrix approximations
- Optimal Approximate Matrix Product in Terms of Stable Rank
- Exploring Algorithmic Limits of Matrix Rank Minimization Under Affine Constraints
- scientific article; zbMATH DE number 756190 (Why is no real title available?)
- scientific article; zbMATH DE number 3992802 (Why is no real title available?)
- Matrix singular value decomposition: a review on the theoretical background and its applications in image processing
- scientific article; zbMATH DE number 7404607 (Why is no real title available?)
- Rank constrained matrix best approximation problem with respect to (skew) Hermitian matrices
- Randomized approximation of the Gram matrix: exact computation and probabilistic bounds
- Optimal regularized inverse matrices for inverse problems
- Goal-oriented optimal approximations of Bayesian linear inverse problems
- A novel representation of rank constraints for real matrices
- Generalized Matrix Nearness Problems
- Fourier spectral factor model for prediction of multidimensional signals
- Optimal modeling of nonlinear systems: method of variable injections
- Fast random vector transforms in terms of pseudo-inverse within the Wiener filtering paradigm
- Optimal approximation of a large matrix by a sum of projected linear mappings on prescribed subspaces
- The numerical least squares solution of large linear systems -- a compromise between speed and accuracy
- Fast multiple rank-constrained matrix approximation
- Leverage score-based quaternion CUR decomposition: gap error analysis and applications
- Matrix approximation by a sum of matrix products
- Optimal low-rank posterior mean and distribution approximation in linear Gaussian inverse problems on Hilbert spaces
- Optimal linear baseline models for scientific machine learning
- Fast adaptive tubal-rank-revealing algorithm for t-product based tensor approximation
- Rank constrained matrix best approximation problem
- A generalization of the Moore-Penrose inverse related to matrix subspaces of \(\mathbb C^{n\times m}\)
This page was built for publication: Generalized Rank-Constrained Matrix Approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301198)
