Two relaxation methods for rank minimization problems
DOI10.1007/S10957-020-01731-9zbMATH Open1441.90166OpenAlexW3047933116MaRDI QIDQ2198528FDOQ2198528
Authors: A. Sagan, Xin Shen, 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
Recommendations
- A penalty method for rank minimization problems in symmetric matrices
- Exact relaxation for the semidefinite matrix rank minimization problem with extended Lyapunov equation constraint
- A nonconvex exact relaxation of the semidefinite matrix rank minimization
- Convex optimization approach to a single quadratically constrained quadratic minimization problem
- Penalty decomposition methods for rank minimization
optimality conditionsconstraint qualificationrank minimizationsemidefinite programs with complementarity constraints
Methods of quasi-Newton type (90C53) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- A Singular Value Thresholding Algorithm for Matrix Completion
- 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
- An implementable proximal point algorithmic framework for nuclear norm minimization
- Title not available (Why is that?)
- Matrix Completion From a Few Entries
- Fixed point and Bregman iterative methods for matrix rank minimization
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- Euclidean distance matrices, semidefinite programming and sensor network localization
- Interior-point method for nuclear norm approximation with application to system identification
- A sequential semismooth Newton method for the nearest low-rank correlation matrix problem
- Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint
- Lower bounds on nonnegative rank via nonnegative nuclear norms
- A rank-corrected procedure for matrix completion with fixed basis coefficients
- First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
- An approximation theory of matrix rank minimization and its application to quadratic equations
- Rapid, robust, and reliable blind deconvolution via nonconvex optimization
- First order necessary optimality conditions for mathematical programs with second-order cone complementarity constraints
- A SURVEY OF NUMERICAL METHODS FOR NONLINEAR SEMIDEFINITE PROGRAMMING
- Title not available (Why is that?)
- Low rank matrix completion by alternating steepest descent methods
- Guarantees of Riemannian optimization for low rank matrix recovery
- A penalty method for rank minimization problems in symmetric matrices
- Equivalent Lipschitz surrogates for zero-norm and rank optimization problems
- Identification of Successive “Unobservable” Cyber Data Attacks in Power Systems Through Matrix Decomposition
Cited In (2)
This page was built for publication: Two relaxation methods for rank minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2198528)
