Two relaxation methods for rank minimization problems
From MaRDI portal
Publication:2198528
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
Cites work
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- A Singular Value Thresholding Algorithm for Matrix Completion
- A penalty method for rank minimization problems in symmetric matrices
- A rank-corrected procedure for matrix completion with fixed basis coefficients
- A sequential semismooth Newton method for the nearest low-rank correlation matrix problem
- A survey of numerical methods for nonlinear semidefinite programming
- An approximation theory of matrix rank minimization and its application to quadratic equations
- An implementable proximal point algorithmic framework for nuclear norm minimization
- Complementarity formulations of \(\ell_0\)-norm optimization
- Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint
- Equivalent Lipschitz surrogates for zero-norm and rank optimization problems
- Euclidean distance matrices, semidefinite programming and sensor network localization
- Exact matrix completion via convex optimization
- First order necessary optimality conditions for mathematical programs with second-order cone complementarity constraints
- First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
- Fixed point and Bregman iterative methods for matrix rank minimization
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Guarantees of Riemannian optimization for low rank matrix recovery
- Identification of Successive “Unobservable” Cyber Data Attacks in Power Systems Through Matrix Decomposition
- Interior-point method for nuclear norm approximation with application to system identification
- Low rank matrix completion by alternating steepest descent methods
- Lower bounds on nonnegative rank via nonnegative nuclear norms
- Matrix Completion From a Few Entries
- Rapid, robust, and reliable blind deconvolution via nonconvex optimization
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
Cited in
(10)- Exact relaxation for the semidefinite matrix rank minimization problem with extended Lyapunov equation constraint
- Multistage convex relaxation approach to rank regularized minimization problems based on equivalent mathematical program with a generalized complementarity constraint
- A penalty method for rank minimization problems in symmetric matrices
- A variational approach of the rank function
- A convex relaxation to compute the nearest structured rank deficient matrix
- Low-rank factorization for rank minimization with nonconvex regularizers
- A novel method for a class of structured low-rank minimizations with equality constraint
- On finding a generalized lowest rank solution to a linear semi-definite feasibility problem
- Several classes of stationary points for rank regularized minimization problems
- An efficient method for convex constrained rank minimization problems based on DC programming
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)
