Null space conditions and thresholds for rank minimization
From MaRDI portal
Publication:633114
DOI10.1007/s10107-010-0422-2zbMath1211.90172OpenAlexW2009006054MaRDI QIDQ633114
Benjamin Recht, Weiyu Xu, Babak Hassibi
Publication date: 31 March 2011
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-010-0422-2
Convex programming (90C25) Approximation methods and heuristics in mathematical programming (90C59) Random matrices (algebraic aspects) (15B52)
Related Items
Checking strict positivity of Kraus maps is NP-hard, High-dimensional change-point estimation: combining filtering with convex optimization, \(s\)-goodness for low-rank matrix recovery, The convex geometry of linear inverse problems, Performance comparisons of greedy algorithms in compressed sensing, Recovery of low-rank matrices based on the rank null space properties, A singular value \(p\)-shrinkage thresholding algorithm for low rank matrix recovery, Proximal iteratively reweighted algorithm for low-rank matrix recovery, A Generalization of Wirtinger Flow for Exact Interferometric Inversion, An approximation theory of matrix rank minimization and its application to quadratic equations, A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems, CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion, A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery, Stable low-rank matrix recovery via null space properties, On a unified view of nullspace-type conditions for recoveries associated with general sparsity structures, Guaranteed clustering and biclustering via semidefinite programming, A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery, Sparse recovery on Euclidean Jordan algebras, Minimax risk of matrix denoising by singular value thresholding, Unnamed Item, Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization, Estimation of (near) low-rank matrices with noise and high-dimensional scaling, Unnamed Item, On minimal rank solutions to symmetric Lyapunov equations in Euclidean Jordan algebra, Guarantees of Riemannian Optimization for Low Rank Matrix Recovery, A Splitting Augmented Lagrangian Method for Low Multilinear-Rank Tensor Recovery
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nuclear norm minimization for the planted clique and biclique problems
- A simple proof of the restricted isometry property for random matrices
- Gaussian processes and almost spherical sections of convex bodies
- Some inequalities for Gaussian processes and applications
- The geometry of graphs and some of its algorithmic applications
- High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
- Exact matrix completion via convex optimization
- On cone-invariant linear matrix inequalities
- A Singular Value Thresholding Algorithm for Matrix Completion
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- 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
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Uncertainty principles and ideal atomic decomposition
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Neighborliness of randomly projected simplices in high dimensions
- Learning Theory
- DISTRIBUTION OF EIGENVALUES FOR SOME SETS OF RANDOM MATRICES
