A hybrid quasi-Newton projected-gradient method with application to Lasso and basis-pursuit denoising
Open Access
- 4 June 2019
- journal article
- research article
- Published by Springer Nature in Mathematical Programming Computation
- Vol. 12 (1) , 1-38
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Sparse Optimization with Least-Squares ConstraintsSIAM Journal on Optimization, 2011
- A limited memory steepest descent methodMathematical Programming, 2011
- Compressed sensing with coherent and redundant dictionariesApplied and Computational Harmonic Analysis, 2011
- Algorithm 890ACM Transactions on Mathematical Software, 2009
- Probing the Pareto Frontier for Basis Pursuit SolutionsSIAM Journal on Scientific Computing, 2009
- Decoding by Linear ProgrammingIEEE Transactions on Information Theory, 2005
- Signal Recovery by Proximal Forward-Backward SplittingMultiscale Modeling & Simulation, 2005
- Atomic Decomposition by Basis PursuitSIAM Journal on Scientific Computing, 1998
- Two-Point Step Size Gradient MethodsIMA Journal of Numerical Analysis, 1988
- On the Goldstein-Levitin-Polyak gradient projection methodIEEE Transactions on Automatic Control, 1976