Low rank matrix completion by alternating steepest descent methods
From MaRDI portal
Publication:905914
DOI10.1016/j.acha.2015.08.003zbMath1336.65047OpenAlexW1548998364MaRDI QIDQ905914
Publication date: 28 January 2016
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.acha.2015.08.003
Analysis of algorithms (68W40) Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Inverse problems in linear algebra (15A29) Iterative numerical methods for linear systems (65F10) Matrix completion problems (15A83)
Related Items
A penalty method for rank minimization problems in symmetric matrices, An Unbiased Approach to Low Rank Recovery, Unnamed Item, Alternating Least Squares as Moving Subspace Correction, On Cluster-Aware Supervised Learning: Frameworks, Convergent Algorithms, and Applications, Guarantees of Riemannian optimization for low rank matrix completion, GNMR: A Provable One-Line Algorithm for Low Rank Matrix Recovery, A divide-and-conquer algorithm for binary matrix completion, Matrix completion with column outliers and sparse noise, Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution, Iterative rank-one matrix completion via singular value decomposition and nuclear norm regularization, Unnamed Item, A two-phase rank-based algorithm for low-rank matrix completion, Two relaxation methods for rank minimization problems, Accelerated low rank matrix approximate algorithms for matrix completion, A singular value thresholding with diagonal-update algorithm for low-rank matrix completion, The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion, Low-rank matrix completion using nuclear norm minimization and facial reduction, Fast rank-one alternating minimization algorithm for phase retrieval, Toeplitz matrix completion via smoothing augmented Lagrange multiplier algorithm, Unnamed Item, Low-rank factorization for rank minimization with nonconvex regularizers, Guarantees of Riemannian Optimization for Low Rank Matrix Recovery, A new method based on the manifold-alternative approximating for low-rank matrix completion, A semi-smoothing augmented Lagrange multiplier algorithm for low-rank Toeplitz matrix completion, Toeplitz matrix completion via a low-rank approximation algorithm, Accelerated Alternating Projections for Robust Principal Component Analysis, A Riemannian rank-adaptive method for low-rank matrix completion, Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries, A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima, Unnamed Item, Matrix Rigidity and the Ill-Posedness of Robust PCA and Matrix Completion
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Matrix recipes for hard thresholding methods
- Fixed-rank matrix factorizations and Riemannian low-rank optimization
- Exact matrix completion via convex optimization
- Low-Rank Matrix Completion by Riemannian Optimization
- Normalized Iterative Hard Thresholding for Matrix Completion
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- A Singular Value Thresholding Algorithm for Matrix Completion
- The complexity of matrix completion
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
- Globally convergent block-coordinate techniques for unconstrained optimization
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- Matrix Completion From a Few Entries
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
