Stochastic variance reduced gradient for affine rank minimization problem
From MaRDI portal
Publication:6587638
DOI10.1137/23M1555387zbMATH Open1545.65241MaRDI QIDQ6587638FDOQ6587638
Authors: Ningning Han, Juan Nie, Jian Lu, Michael Ng 
Publication date: 14 August 2024
Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)
Recommendations
- On linear convergence of projected gradient method for a class of affine rank minimization problems
- An algorithm for affine rank minimization problem
- An analysis of stochastic variance reduced gradient for linear inverse problems *
- Low-rank matrix recovery via iteratively reweighted least squares minimization
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
Numerical mathematical programming methods (65K05) Convex programming (90C25) Matrix completion problems (15A83)
Cites Work
- Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
- A Singular Value Thresholding Algorithm for Matrix Completion
- Two-Point Step Size Gradient Methods
- 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
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Fixed point and Bregman iterative methods for matrix rank minimization
- Low-rank matrix completion by Riemannian optimization
- Alternating projection methods.
- Interior-point method for nuclear norm approximation with application to system identification
- A simpler approach to matrix completion
- Low-rank matrix recovery via iteratively reweighted least squares minimization
- Title not available (Why is that?)
- Normalized iterative hard thresholding for matrix completion
- Linear Convergence of Stochastic Iterative Greedy Algorithms With Sparse Constraints
- Weighted Schatten <inline-formula> <tex-math notation="LaTeX">$p$ </tex-math> </inline-formula>-Norm Minimization for Image Denoising and Background Subtraction
- Finding low-rank solutions via nonconvex matrix factorization, efficiently and provably
- Nonconvex Robust Low-Rank Matrix Recovery
- Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- Low rank matrix completion by alternating steepest descent methods
- Guarantees of Riemannian optimization for low rank matrix recovery
- An Adaptive Correction Approach for Tensor Completion
- A Corrected Tensor Nuclear Norm Minimization Method for Noisy Low-Rank Tensor Completion
- Optimum Co-Design for Spectrum Sharing between Matrix Completion Based MIMO Radars and a MIMO Communication System
- Matrix Completion in Colocated MIMO Radar: Recoverability, Bounds & Theoretical Guarantees
- GNMR: a provable one-line algorithm for low rank matrix recovery
- Title not available (Why is that?)
This page was built for publication: Stochastic variance reduced gradient for affine rank minimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587638)
