A simple homotopy proximal mapping algorithm for compressive sensing
From MaRDI portal
Publication:2425244
Recommendations
- A proximal-gradient homotopy method for the sparse least-squares problem
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- A linearly convergent algorithm for sparse signal reconstruction
- Hard thresholding pursuit: an algorithm for compressive sensing
- Decomposable norm minimization with proximal-gradient homotopy algorithm
Cites work
- A Bound on Tail Probabilities for Quadratic Forms in Independent Random Variables
- A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A new approach to variable selection in least squares problems
- A primal-dual homotopy algorithm for \(\ell _{1}\)-minimization with \(\ell _{\infty }\)-constraints
- A proximal-gradient homotopy method for the sparse least-squares problem
- A sparse Johnson-Lindenstrauss transform
- Accurate Prediction of Phase Transitions in Compressed Sensing via a Connection to Minimax Denoising
- Adaptive greedy approximations
- An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization
- An infeasible-point subgradient method using adaptive approximate projections
- Atomic decomposition by basis pursuit
- Atomic Decomposition by Basis Pursuit
- Bonferroni inequalities
- Compressed sensing
- Convex Analysis
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Decoding by Linear Programming
- Decomposable norm minimization with proximal-gradient homotopy algorithm
- Extensions of Lipschitz mappings into a Hilbert space
- Fast global convergence of gradient methods for high-dimensional statistical recovery
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- Fixed-Point Continuation for \ell₁-Minimization: Methodology and Convergence
- Greed is Good: Algorithmic Results for Sparse Approximation
- Hard thresholding pursuit: an algorithm for compressive sensing
- High-dimensional graphs and variable selection with the Lasso
- scientific article; zbMATH DE number 5957408 (Why is no real title available?)
- scientific article; zbMATH DE number 50401 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Iterative hard thresholding for compressed sensing
- Just relax: convex programming methods for identifying sparse signals in noise
- Least angle regression. (With discussion)
- Linear convergence of iterative soft-thresholding
- Matching pursuits with time-frequency dictionaries
- Matrix recipes for hard thresholding methods
- NESTA: A fast and accurate first-order method for sparse recovery
- Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
- On the conditions used to prove oracle results for the Lasso
- One-bit compressed sensing by linear programming
- Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.
- Probing the Pareto frontier for basis pursuit solutions
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- Sharp Time–Data Tradeoffs for Linear Inverse Problems
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Simultaneous analysis of Lasso and Dantzig selector
- Solving basis pursuit: heuristic optimality check and solver comparison
- Some sharp performance bounds for least squares regression with L₁ regularization
- Sparse Reconstruction by Separable Approximation
- Sparse Recovery of Streaming Signals Using <formula formulatype="inline"><tex Notation="TeX">$\ell_1$</tex></formula>-Homotopy
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Sparser Johnson-Lindenstrauss transforms
- Stable signal recovery from incomplete and inaccurate measurements
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- The Noise-Sensitivity Phase Transition in Compressed Sensing
- The restricted isometry property and its implications for compressed sensing
- The sparsity and bias of the LASSO selection in high-dimensional linear regression
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
Cited in
(3)
This page was built for publication: A simple homotopy proximal mapping algorithm for compressive sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425244)
