FaRSA for ℓ1-regularized convex optimization: local convergence and numerical experience. (4th March 2018)

• Record Type: Journal Article
• Authors: Chen, Tianyi; Curtis, Frank E.; Robinson, Daniel P.
• Is Part Of: Optimization methods and software. Volume 33:Number 2(2018)
• Page Start: 396
• Page End: 415
• Publication Date: 2018-03-04
• Subjects: nonlinear optimization -- convex optimization -- sparse optimization -- active-set methods -- reduced-space methods -- subspace minimization -- model prediction; 49J52 -- 62–07 -- 65K05 -- 90C25 -- 90C30; Mathematical optimization -- Periodicals; Algorithms -- Periodicals; 519.7
• DOI: 10.1080/10556788.2017.1415336
• Languages: English
• ISSNs: 1055-6788

Abstract

Abstract : FaRSA is a new method for minimizing the sum of a differentiable convex function and an -norm regularizer. The main features of the method include: (i) an evolving set of indices corresponding to variables that are predicted to be nonzero at a solution; (ii) subproblems that only need to be solved in a reduced space to lessen per-iteration computational costs; (iii) conditions that determine how accurately each subproblem must be solved, which allow conjugate gradient or coordinate descent techniques to be employed; (iv) a computationally practical condition that dictates when the subspace explored by the current subproblem should be updated; and (v) a reduced proximal gradient step that ensures a sufficient decrease in the objective function when it is decided that the index set that holds the nonzero variables should be expanded. We proved global convergence of the method and demonstrated its performance on a set of model prediction problems with a Matlab implementation. Here, we introduce an enhanced subproblem termination condition that allows us to prove that the iterates converge locally at a superlinear rate. Moreover, we present the details of our publicly available C implementation along with extensive numerical comparisons to other state-of-the-art solvers.