A time continuation based fast approximate algorithm for compressed sensing related optimization
From MaRDI portal
Publication:5501146
DOI10.1090/mcom/2972zbMath1322.49050arXiv1310.6475OpenAlexW1596080035MaRDI QIDQ5501146
Farzin Barekat, Stanley J. Osher
Publication date: 13 August 2015
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.6475
homotopy methodscompressed sensingLagrangian dual problemprimal problemaugmented \(\ell^1\)-minimizationexact regularization property
Convex programming (90C25) Numerical methods involving duality (49M29) Numerical optimization and variational techniques (65K10)
Uses Software
Cites Work
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Modern homotopy methods in optimization
- Templates for convex cone problems with applications to sparse signal recovery
- Least angle regression. (With discussion)
- Theory of Globally Convergent Probability-One Homotopies for Nonlinear Programming
- Atomic Decomposition by Basis Pursuit
- Augmented $\ell_1$ and Nuclear-Norm Models with a Globally Linearly Convergent Algorithm
- Analysis and Generalizations of the Linearized Bregman Method
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- On Convex Finite-Dimensional Variational Methods in Imaging Sciences and Hamilton--Jacobi Equations
- Exact Regularization of Convex Programs
- Decoding by Linear Programming
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- Two-Point Step Size Gradient Methods
- A new approach to variable selection in least squares problems
- Matching pursuits with time-frequency dictionaries
- An adaptive inverse scale space method for compressed sensing
- Exact Regularization of Polyhedral Norms
- A dual split Bregman method for fast $\ell ^1$ minimization
