A non-convex algorithm framework based on DC programming and DCA for matrix completion
From MaRDI portal
Publication:2340366
DOI10.1007/s11075-014-9876-2zbMath1312.65093OpenAlexW1966157242MaRDI QIDQ2340366
Juan Geng, Laisheng Wang, Yanfei Wang
Publication date: 16 April 2015
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-014-9876-2
matrix completionimage recoverynumerical testnonconvex penaltynuclear norm minimizationDC algorithmsnonconvex algorithm
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Matrix completion problems (15A83)
Related Items
A new nonconvex approach to low-rank matrix completion with application to image inpainting, DC programming and DCA: thirty years of developments
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- An implementable proximal point algorithmic framework for nuclear norm minimization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- DC programming: overview.
- Exact matrix completion via convex optimization
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- EXACT LOW-RANK MATRIX RECOVERY VIA NONCONVEX SCHATTEN p-MINIMIZATION
- Normalized Iterative Hard Thresholding for Matrix Completion
- An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
- A Singular Value Thresholding Algorithm for Matrix Completion
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- Sharp Oracle Inequalities for High-Dimensional Matrix Prediction
- ADMiRA: Atomic Decomposition for Minimum Rank Approximation
- Matrix Completion From a Few Entries
