Optimization Online


A Fast Active Set Block Coordinate Descent Algorithm for l1-regularized least squares

Marianna De Santis (msantis***at***math.tu-dortmund.de)
Stefano Lucidi (lucidi***at***dis.uniroma1.it)
Francesco Rinaldi (rinaldi***at***math.unipd.it)

Abstract: The problem of finding sparse solutions to underdetermined systems of linear equations arises in several real-world problems (e.g. signal and image processing, compressive sensing, statistical inference). A standard tool for dealing with sparse recovery is the l1-regularized least-squares approach that has been recently attracting the attention of many researchers. In this paper, we describe an efficient block active set coordinate descent algorithm that at each iteration use a bunch of variables (i.e. those variables which are non-active and violate the most some specific optimality conditions) to improve the objective function. We further analyze the convergence properties of the proposed method. Finally, we report some numerical results showing the effectiveness of the approach.

Keywords: l1-regularized least squares, active set, sparse optimization

Category 1: Convex and Nonsmooth Optimization

Category 2: Nonlinear Optimization (Nonlinear Systems and Least-Squares )


Download: [PDF]

Entry Submitted: 03/07/2014
Entry Accepted: 03/07/2014
Entry Last Modified: 09/09/2015

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society