On the performance of algorithms for the minimization of -penalized functionals
arXiv:0710.4082 · doi:10.1088/0266-5611/25/3/035008
Abstract
The problem of assessing the performance of algorithms used for the minimization of an -penalized least-squares functional, for a range of penalty parameters, is investigated. A criterion that uses the idea of `approximation isochrones' is introduced. Five different iterative minimization algorithms are tested and compared, as well as two warm-start strategies. Both well-conditioned and ill-conditioned problems are used in the comparison, and the contrast between these two categories is highlighted.
18 pages, 10 figures; v3: expanded version with an additional synthetic test problems
References in corpus (3)
Cited by in corpus (16)
- NESTA: A Fast and Accurate First-order Method for Sparse Recovery
- Compressive estimation of doubly selective channels in multicarrier systems: Leakage effects and sparsity-enhancing processing
- Compressive Phase Retrieval From Squared Output Measurements Via Semidefinite Programming
- Fast L1-Minimization Algorithms For Robust Face Recognition
- Accelerating gradient projection methods for -constrained signal recovery by steplength selection rules
- Nonlinear regularization techniques for seismic tomography
- Nonparametric sparsity and regularization
- Elastic-Net Regularization: Error estimates and Active Set Methods
- L1Packv2: A Mathematica package for minimizing an -penalized functional
- On the Complexity of the Weighted Fused Lasso
- Constructing test instances for Basis Pursuit Denoising
- A CG-type method in Banach spaces with an application to computerized tomography
- Convex Optimization approach to signals with fast varying instantaneous frequency
- Speeding-Up Convergence via Sequential Subspace Optimization: Current State and Future Directions
- Elastic-net regularization for nonlinear electrical impedance tomography with a splitting approach
- Neurally Augmented ALISTA