A simple homotopy proximal mapping algorithm for compressive sensing
From MaRDI portal
Publication:2425244
DOI10.1007/s10994-018-5772-7zbMath1493.94008WikidataQ128937890 ScholiaQ128937890MaRDI QIDQ2425244
Tianbao Yang, Zhi-Hua Zhou, Rong Jin, Shenghuo Zhu, Li-jun Zhang
Publication date: 26 June 2019
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-018-5772-7
94A12: Signal theory (characterization, reconstruction, filtering, etc.)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- An infeasible-point subgradient method using adaptive approximate projections
- Decomposable norm minimization with proximal-gradient homotopy algorithm
- Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.
- Iterative hard thresholding for compressed sensing
- Linear convergence of iterative soft-thresholding
- Fast global convergence of gradient methods for high-dimensional statistical recovery
- Some sharp performance bounds for least squares regression with \(L_1\) regularization
- The restricted isometry property and its implications for compressed sensing
- The sparsity and bias of the LASSO selection in high-dimensional linear regression
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- Bonferroni inequalities
- A primal-dual homotopy algorithm for \(\ell _{1}\)-minimization with \(\ell _{\infty }\)-constraints
- Least angle regression. (With discussion)
- On the conditions used to prove oracle results for the Lasso
- Matrix recipes for hard thresholding methods
- An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization
- Simultaneous analysis of Lasso and Dantzig selector
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- High-dimensional graphs and variable selection with the Lasso
- Atomic Decomposition by Basis Pursuit
- One-Bit Compressed Sensing by Linear Programming
- A Proximal-Gradient Homotopy Method for the Sparse Least-Squares Problem
- A sparse Johnson
- Accurate Prediction of Phase Transitions in Compressed Sensing via a Connection to Minimax Denoising
- A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
- NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
- Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
- Sparser Johnson-Lindenstrauss Transforms
- Extensions of Lipschitz mappings into a Hilbert space
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Decoding by Linear Programming
- Greed is Good: Algorithmic Results for Sparse Approximation
- Just relax: convex programming methods for identifying sparse signals in noise
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Probing the Pareto Frontier for Basis Pursuit Solutions
- Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- Atomic Decomposition by Basis Pursuit
- A new approach to variable selection in least squares problems
- Sparse Reconstruction by Separable Approximation
- Sparse Recovery of Streaming Signals Using <formula formulatype="inline"><tex Notation="TeX">$\ell_1$</tex></formula>-Homotopy
- Matching pursuits with time-frequency dictionaries
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- Solving Basis Pursuit
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- The Noise-Sensitivity Phase Transition in Compressed Sensing
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Sharp Time–Data Tradeoffs for Linear Inverse Problems
- Stable signal recovery from incomplete and inaccurate measurements
- Convex Analysis
- A Bound on Tail Probabilities for Quadratic Forms in Independent Random Variables
- Compressed sensing
- Adaptive greedy approximations
