Exact minimum rank approximation via Schatten \(p\)-norm minimization

DOI10.1016/j.cam.2014.02.015zbMath1293.65056MaRDI QIDQ396052

Wei Huang, Lu Liu, Di-Rong Chen

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

zbMATH Keywords

singular value decomposition; random matrix; Schatten \(p\)-norm; rank minimization; majorization minimization; restricted isometry constant

Mathematics Subject Classification ID

15A23: Factorization of matrices

65F15: Numerical computation of eigenvalues and eigenvectors of matrices

15A60: Norms of matrices, numerical range, applications of functional analysis to matrix theory

15A83: Matrix completion problems

Related Items

Recovery of low-rank matrices based on the rank null space properties, Proximal iteratively reweighted algorithm for low-rank matrix recovery, Multiple kernel low-rank representation-based robust multi-view subspace clustering, Robust image compressive sensing based on half-quadratic function and weighted Schatten-\(p\) norm, Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization, Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery, Stable recovery of low-rank matrix via nonconvex Schatten \(p\)-minimization, Robust subspace clustering based on non-convex low-rank approximation and adaptive kernel, Multi-band weighted \(l_p\) norm minimization for image denoising, Recovery of Low Rank Symmetric Matrices via Schatten p Norm Minimization

Uses Software

• softImpute
• ADMiRA

Cites Work

• Unnamed Item
• Unnamed Item
• Fixed point and Bregman iterative methods for matrix rank minimization
• Estimation of high-dimensional low-rank matrices
• Weighted minimum trace factor analysis
• Exact matrix completion via convex optimization
• Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
• A Linearly Convergent Algorithm for Solving a Class of Nonconvex/Affine Feasibility Problems
• Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• On the rank minimization problem over a positive semidefinite linear matrix inequality
• ADMiRA: Atomic Decomposition for Minimum Rank Approximation
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
• Stable signal recovery from incomplete and inaccurate measurements