Two relaxation methods for rank minimization problems
From MaRDI portal
Publication:2198528
DOI10.1007/s10957-020-01731-9zbMath1441.90166MaRDI QIDQ2198528
Xin Shen, April Sagan, John E. Mitchell
Publication date: 10 September 2020
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-020-01731-9
optimality conditions; constraint qualification; rank minimization; semidefinite programs with complementarity constraints
90C53: Methods of quasi-Newton type
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A rank-corrected procedure for matrix completion with fixed basis coefficients
- An approximation theory of matrix rank minimization and its application to quadratic equations
- An implementable proximal point algorithmic framework for nuclear norm minimization
- First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
- Fixed point and Bregman iterative methods for matrix rank minimization
- Euclidean distance matrices, semidefinite programming and sensor network localization
- Lower bounds on nonnegative rank via nonnegative nuclear norms
- First order necessary optimality conditions for mathematical programs with second-order cone complementarity constraints
- Low rank matrix completion by alternating steepest descent methods
- A penalty method for rank minimization problems in symmetric matrices
- Equivalent Lipschitz surrogates for zero-norm and rank optimization problems
- Rapid, robust, and reliable blind deconvolution via nonconvex optimization
- Exact matrix completion via convex optimization
- Guarantees of Riemannian Optimization for Low Rank Matrix Recovery
- A Singular Value Thresholding Algorithm for Matrix Completion
- A Sequential Semismooth Newton Method for the Nearest Low-rank Correlation Matrix Problem
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- Identification of Successive “Unobservable” Cyber Data Attacks in Power Systems Through Matrix Decomposition
- Conditional Gradient Algorithmsfor Rank-One Matrix Approximations with a Sparsity Constraint
- Matrix Completion From a Few Entries
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- A SURVEY OF NUMERICAL METHODS FOR NONLINEAR SEMIDEFINITE PROGRAMMING