An alternating minimization method for matrix completion problems
Publication:2182816
DOI10.3934/dcdss.2020103zbMath1441.15020OpenAlexW2971384615WikidataQ127232270 ScholiaQ127232270MaRDI QIDQ2182816
Publication date: 26 May 2020
Published in: Discrete and Continuous Dynamical Systems. Series S (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/dcdss.2020103
singular value decompositionmatrix completionalternating minimizationsymmetric low rank product minimization
Factorization of matrices (15A23) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Eigenvalues, singular values, and eigenvectors (15A18) Matrix completion problems (15A83)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- An implementable proximal point algorithmic framework for nuclear norm minimization
- Fixed point and Bregman iterative methods for matrix rank minimization
- Introductory lectures on convex optimization. A basic course.
- A note on the alternating direction method of multipliers
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Quantitative robust uncertainty principles and optimally sparse decompositions
- Exact matrix completion via convex optimization
- Fast and Near-Optimal Matrix Completion via Randomized Basis Pursuit
- A Convergent $3$-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block
- Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
- A Singular Value Thresholding Algorithm for Matrix Completion
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Why Simple Shrinkage Is Still Relevant for Redundant Representations?
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- An Efficient TVL1 Algorithm for Deblurring Multichannel Images Corrupted by Impulsive Noise
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- Nonconvex Splitting for Regularized Low-Rank + Sparse Decomposition
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- ADMiRA: Atomic Decomposition for Minimum Rank Approximation
- Matrix Completion From a Few Entries
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- A Simpler Approach to Matrix Completion
- An Efficient Gauss--Newton Algorithm for Symmetric Low-Rank Product Matrix Approximations
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
- Compressed sensing
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent