Exact minimum rank approximation via Schatten p-norm minimization
DOI10.1016/J.CAM.2014.02.015zbMATH Open1293.65056OpenAlexW2108165393MaRDI QIDQ396052FDOQ396052
Authors: Di-Rong Chen, Lu Liu, Wei Huang 
Publication date: 8 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.2014.02.015
Recommendations
- Stable recovery of low-rank matrix via nonconvex Schatten \(p\)-minimization
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- On the Schatten \(p\)-quasi-norm minimization for low-rank matrix recovery
- Proximal linearization methods for Schatten \(p\)-quasi-norm minimization
- Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery
random matrixsingular value decompositionSchatten \(p\)-normrank minimizationmajorization minimizationrestricted isometry constant
Factorization of matrices (15A23) Matrix completion problems (15A83) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60)
Cites Work
- Spectral regularization algorithms for learning large incomplete matrices
- ADMiRA: Atomic Decomposition for Minimum Rank Approximation
- Exact matrix completion via convex optimization
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Estimation of high-dimensional low-rank matrices
- Stable signal recovery from incomplete and inaccurate measurements
- Weighted minimum trace factor analysis
- Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
- Fixed point and Bregman iterative methods for matrix rank minimization
- Interior-point method for nuclear norm approximation with application to system identification
- On the rank minimization problem over a positive semidefinite linear matrix inequality
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Title not available (Why is that?)
- A linearly convergent algorithm for solving a class of nonconvex/affine feasibility problems
Cited In (18)
- Approximating minimum norm solutions of rank-deficient least squares problems
- Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery
- A \(p\)-spherical section property for matrix Schatten-\(p\) quasi-norm minimization
- Multiple kernel low-rank representation-based robust multi-view subspace clustering
- On the Schatten \(p\)-quasi-norm minimization for low-rank matrix recovery
- A nonconvex exact relaxation of the semidefinite matrix rank minimization
- Stable recovery of low-rank matrix via nonconvex Schatten \(p\)-minimization
- Dual-dual subspace learning with low-rank consideration for feature selection
- Recovery of low rank symmetric matrices via Schatten \(p\) norm minimization
- Multi-band weighted \(l_p\) norm minimization for image denoising
- Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization
- Recovery of low-rank matrices based on the rank null space properties
- Exact low-rank matrix recovery via nonconvex Schatten \(p\)-minimization
- Proximal iteratively reweighted algorithm for low-rank matrix recovery
- Low-Rank Matrix Recovery via Modified Schatten-$p$ Norm Minimization With Convergence Guarantees
- Orthogonalization Via Deflation: A Minimum Norm Approach for Low-Rank Approximations of a Matrix
- Robust subspace clustering based on non-convex low-rank approximation and adaptive kernel
- Robust image compressive sensing based on half-quadratic function and weighted Schatten-\(p\) norm
Uses Software
This page was built for publication: Exact minimum rank approximation via Schatten \(p\)-norm minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396052)
