An approximation theory of matrix rank minimization and its application to quadratic equations
From MaRDI portal
Publication:417562
DOI10.1016/j.laa.2012.02.021zbMath1242.65086arXiv1010.0851MaRDI QIDQ417562
Publication date: 14 May 2012
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.0851
65K05: Numerical mathematical programming methods
90C22: Semidefinite programming
90C59: Approximation methods and heuristics in mathematical programming
15A60: Norms of matrices, numerical range, applications of functional analysis to matrix theory
Related Items
Exploiting low-rank structure in semidefinite programming by approximate operator splitting, A variational approach of the rank function, Approximation of rank function and its application to the nearest low-rank correlation matrix, First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints, A new approximation of the matrix rank function and its application to matrix rank minimization, Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications, The viscosity subdifferential of the rank function via the corresponding subdifferential of its Moreau envelopes, A new nonconvex approach to low-rank matrix completion with application to image inpainting, On finding a generalized lowest rank solution to a linear semi-definite feasibility problem, Minimum rank positive semidefinite solution to the matrix approximation problem in the spectral norm, Miscellaneous reverse order laws for generalized inverses of matrix products with applications, Two relaxation methods for rank minimization problems, A reweighted nuclear norm minimization algorithm for low rank matrix recovery, Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers, Rank-constrained optimization and its applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Convergence of fixed-point continuation algorithms for matrix rank minimization
- Fixed point and Bregman iterative methods for matrix rank minimization
- Null space conditions and thresholds for rank minimization
- Nuclear norm minimization for the planted clique and biclique problems
- Theory of semidefinite programming for sensor network localization
- On the rank minimization problem and its control applications
- A recurring theorem about pairs of quadratic forms and extensions: A survey
- Distance matrix completion by numerical optimization
- Permanently going back and forth between the ``quadratic world and the ``convexity world in optimization
- Rank-one LMI approach to simultaneous stabilization of linear systems.
- The geometry of graphs and some of its algorithmic applications
- Rank-one solutions for homogeneous linear matrix equations over the positive semidefinite cone
- A unified approach for minimizing composite norms
- Über das Vorkommen definiter und semidefiniter Formen in Scharen quadratischer Formen
- Exact matrix completion via convex optimization
- Rank-Sparsity Incoherence for Matrix Decomposition
- On the Field of Values of a Matrix
- Potpourri of Conjectures and Open Questions in Nonlinear Analysis and Optimization
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Linear Matrix Inequalities in System and Control Theory
- On the rank minimization problem over a positive semidefinite linear matrix inequality
- Sparse Approximate Solutions to Linear Systems
- On linear combinations of quadratic forms
- Compressed sensing
