A nonconvex approach to low-rank matrix completion using convex optimization.
From MaRDI portal
Publication:2955982
DOI10.1002/NLA.2055zbMATH Open1413.65172OpenAlexW2474482491MaRDI QIDQ2955982FDOQ2955982
Authors: D. Lazzaro 
Publication date: 13 January 2017
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11585/565705
Recommendations
- A new nonconvex approach to low-rank matrix completion with application to image inpainting
- A non-convex algorithm framework based on DC programming and DCA for matrix completion
- Matrix completion via minimizing an approximate rank
- An alternating direction method with continuation for nonconvex low rank minimization
- A fast proximal iteratively reweighted nuclear norm algorithm for nonconvex low-rank matrix minimization problems
convex optimizationmatrix completionnonconvex minimizationforward-backward splittingproximity operatormatrix setting
Cites Work
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Solving semidefinite-quadratic-linear programs using SDPT3
- A Singular Value Thresholding Algorithm for Matrix Completion
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- 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
- Stable signal recovery from incomplete and inaccurate measurements
- Proximal splitting methods in signal processing
- Signal Recovery by Proximal Forward-Backward Splitting
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
- An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Matrix Completion From a Few Entries
- Fixed point and Bregman iterative methods for matrix rank minimization
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- On Fréchet subdifferentials
- A trace inequality of John von Neumann
- Low-rank matrix recovery via iteratively reweighted least squares minimization
- Proximal Thresholding Algorithm for Minimization over Orthonormal Bases
- Title not available (Why is that?)
- Sparse Signal Estimation by Maximally Sparse Convex Optimization
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- Convergence results for projected line-search methods on varieties of low-rank matrices via Łojasiewicz inequality
- Title not available (Why is that?)
- Fast Sparse Image Reconstruction Using Adaptive Nonlinear Filtering
Cited In (17)
- Log-sum penalized Poisson loss minimization for matrix recovery
- An alternating direction method with continuation for nonconvex low rank minimization
- A non-convex algorithm framework based on DC programming and DCA for matrix completion
- A novel nonconvex relaxation approach to low-rank matrix completion of inexact observed data
- Affine matrix rank minimization problem via non-convex fraction function penalty
- Low-rank matrix recovery with Ky Fan 2-\(k\)-norm
- Incremental quaternion singular value decomposition and its application for low rank quaternion matrix completion
- Matrix completion via minimizing an approximate rank
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Matrix completion for matrices with low-rank displacement
- Low-rank matrix completion in a general non-orthogonal basis
- Low-Rank Matrix Estimation from Rank-One Projections by Unlifted Convex Optimization
- Model-free nonconvex matrix completion: local minima analysis and applications in memory-efficient kernel PCA
- 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
- Transformed Schatten-1 iterative thresholding algorithms for low rank matrix completion
- A new nonconvex approach to low-rank matrix completion with application to image inpainting
Uses Software
This page was built for publication: A nonconvex approach to low-rank matrix completion using convex optimization.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2955982)
