A non-convex algorithm framework based on DC programming and DCA for matrix completion

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Solving semidefinite-quadratic-linear programs using SDPT3
ADMiRA: Atomic Decomposition for Minimum Rank Approximation
Enhancing sparsity by reweighted $\ell _{1}$ minimization
Convex analysis approach to d. c. programming: Theory, algorithms and applications
DC programming: overview.
A Singular Value Thresholding Algorithm for Matrix Completion
Exact matrix completion via convex optimization
Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
Eigentaste: A constant time collaborative filtering algorithm
Improved iteratively reweighted least squares for unconstrained smoothed $\ell_q$ minimization
An implementable proximal point algorithmic framework for nuclear norm minimization
Matrix Completion From a Few Entries
Sparsest solutions of underdetermined linear systems via $ \ell _q$-minimization for $0<q\leqslant 1$
An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
Exact low-rank matrix recovery via nonconvex Schatten $p$-minimization
Sharp Oracle Inequalities for High-Dimensional Matrix Prediction
Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
Normalized iterative hard thresholding for matrix completion

Cited In (3)

Matrix recovery from nonconvex regularized least absolute deviations
DC programming and DCA: thirty years of developments
A new nonconvex approach to low-rank matrix completion with application to image inpainting

Uses Software

SeDuMi
SDPT3
Eigentaste
ADMiRA

This page was built for publication: A non-convex algorithm framework based on DC programming and DCA for matrix completion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2340366)