A nonconvex approach to low-rank matrix completion using convex optimization
From MaRDI portal
Publication:2955982
DOI10.1002/nla.2055zbMath1413.65172OpenAlexW2474482491MaRDI QIDQ2955982
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
convex optimizationmatrix completionnonconvex minimizationforward-backward splittingproximity operatormatrix setting
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Solving semidefinite-quadratic-linear programs using SDPT3
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Fixed point and Bregman iterative methods for matrix rank minimization
- A trace inequality of John von Neumann
- On Fréchet subdifferentials
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Exact matrix completion via convex optimization
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- Proximal Splitting Methods in Signal Processing
- Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality
- A Singular Value Thresholding Algorithm for Matrix Completion
- Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Proximal Thresholding Algorithm for Minimization over Orthonormal Bases
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Sparse Signal Estimation by Maximally Sparse Convex Optimization
- Matrix Completion From a Few Entries
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Fast Sparse Image Reconstruction Using Adaptive Nonlinear Filtering
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- Signal Recovery by Proximal Forward-Backward Splitting
- Stable signal recovery from incomplete and inaccurate measurements
This page was built for publication: A nonconvex approach to low-rank matrix completion using convex optimization
