Performance of First- and Second-Order Methods for L1-Regularized Least Squares Problems
arXiv:1503.03520
Abstract
We study the performance of first- and second-order optimization methods for l1-regularized sparse least-squares problems as the conditioning of the problem changes and the dimensions of the problem increase up to one trillion. A rigorously defined generator is presented which allows control of the dimensions, the conditioning and the sparsity of the problem. The generator has very low memory requirements and scales well with the dimensions of the problem.
arXiv comment32 pages, 11 figures
References in corpus (5)
- Templates for Convex Cone Problems with Applications to Sparse Signal Recovery
- A quasi-Newton proximal splitting method
- A Second-Order Method for Strongly Convex L1-Regularization Problems
- An Inexact Successive Quadratic Approximation Method for Convex L-1 Regularized Optimization
- Practical Inexact Proximal Quasi-Newton Method with Global Complexity Analysis