A non-convex algorithm framework based on DC programming and DCA for matrix completion
From MaRDI portal
(Redirected from Publication:2340366)
Recommendations
- A nonconvex approach to low-rank matrix completion using convex optimization.
- A new nonconvex approach to low-rank matrix completion with application to image inpainting
- Matrix completion with nonconvex regularization: spectral operators and scalable algorithms
- A fast proximal iteratively reweighted nuclear norm algorithm for nonconvex low-rank matrix minimization problems
- Low-rank matrix recovery with Ky Fan 2-\(k\)-norm
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 823379 (Why is no real title available?)
- scientific article; zbMATH DE number 3895043 (Why is no real title available?)
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A Singular Value Thresholding Algorithm for Matrix Completion
- ADMiRA: Atomic Decomposition for Minimum Rank Approximation
- An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
- An implementable proximal point algorithmic framework for nuclear norm minimization
- An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC programming: overview.
- Eigentaste: A constant time collaborative filtering algorithm
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Exact low-rank matrix recovery via nonconvex Schatten \(p\)-minimization
- Exact matrix completion via convex optimization
- Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
- Matrix Completion From a Few Entries
- Normalized iterative hard thresholding for matrix completion
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- Sharp Oracle Inequalities for High-Dimensional Matrix Prediction
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Solving semidefinite-quadratic-linear programs using SDPT3
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(5)- Matrix recovery from nonconvex regularized least absolute deviations
- DC programming and DCA: thirty years of developments
- A nonconvex approach to low-rank matrix completion using convex optimization.
- Matrix completion with nonconvex regularization: spectral operators and scalable algorithms
- A new nonconvex approach to low-rank matrix completion with application to image inpainting
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)
