Matrix recipes for hard thresholding methods
From MaRDI portal
Publication:2251217
DOI10.1007/s10851-013-0434-7zbMath1311.90141arXiv1203.4481OpenAlexW2023101933MaRDI QIDQ2251217
Volkan Cevher, Anastasios Kyrillidis
Publication date: 11 July 2014
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.4481
Related Items (32)
Minimum \( n\)-rank approximation via iterative hard thresholding ⋮ Structured Sparsity: Discrete and Convex Approaches ⋮ Low rank matrix recovery from rank one measurements ⋮ Guarantees of Riemannian optimization for low rank matrix completion ⋮ GNMR: A Provable One-Line Algorithm for Low Rank Matrix Recovery ⋮ Fast gradient method for low-rank matrix estimation ⋮ A simple homotopy proximal mapping algorithm for compressive sensing ⋮ Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems ⋮ Heavy-ball-based hard thresholding algorithms for sparse signal recovery ⋮ Compressed sensing of low-rank plus sparse matrices ⋮ CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion ⋮ Low rank matrix completion by alternating steepest descent methods ⋮ Greedy-like algorithms for the cosparse analysis model ⋮ The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion ⋮ Matrix recipes for hard thresholding methods ⋮ Low-Rank Tensor Recovery using Sequentially Optimal Modal Projections in Iterative Hard Thresholding (SeMPIHT) ⋮ Toeplitz matrix completion via smoothing augmented Lagrange multiplier algorithm ⋮ Homotopy method for matrix rank minimization based on the matrix hard thresholding method ⋮ Unnamed Item ⋮ Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems ⋮ A non-Euclidean gradient descent method with sketching for unconstrained matrix minimization ⋮ GPU accelerated greedy algorithms for compressed sensing ⋮ Guarantees of Riemannian Optimization for Low Rank Matrix Recovery ⋮ A new method based on the manifold-alternative approximating for low-rank matrix completion ⋮ Structured random measurements in signal processing ⋮ Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably ⋮ A semi-smoothing augmented Lagrange multiplier algorithm for low-rank Toeplitz matrix completion ⋮ Matrix completion via minimizing an approximate rank ⋮ Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries ⋮ Unnamed Item ⋮ Matrix Rigidity and the Ill-Posedness of Robust PCA and Matrix Completion ⋮ Low rank matrix recovery with adversarial sparse noise*
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Solving quadratic equations via phaselift when there are about as many equations as unknowns
- Convergence of fixed-point continuation algorithms for matrix rank minimization
- Clustering large graphs via the singular value decomposition
- Iterative hard thresholding for compressed sensing
- Learning non-parametric basis independent models from point queries via low-rank methods
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Introductory lectures on convex optimization. A basic course.
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Matrix recipes for hard thresholding methods
- Parallel stochastic gradient algorithms for large-scale matrix completion
- Exact matrix completion via convex optimization
- Normalized Iterative Hard Thresholding for Matrix Completion
- A Linearly Convergent Algorithm for Solving a Class of Nonconvex/Affine Feasibility Problems
- Robust principal component analysis?
- A Singular Value Thresholding Algorithm for Matrix Completion
- Compressed sensing and best 𝑘-term approximation
- Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
- Greed is Good: Algorithmic Results for Sparse Approximation
- Matrix approximation and projective clustering via volume sampling
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Adaptive Sampling and Fast Low-Rank Matrix Approximation
- Sparse Approximate Solutions to Linear Systems
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- ADMiRA: Atomic Decomposition for Minimum Rank Approximation
- Matrix Completion From a Few Entries
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Noiselets
This page was built for publication: Matrix recipes for hard thresholding methods
