Accelerating block coordinate descent methods with identification strategies

R. Lopes (), S. A. Santos () and P. J. S. Silva ()
Additional contact information
R. Lopes: University of Campinas
S. A. Santos: University of Campinas
P. J. S. Silva: University of Campinas

Computational Optimization and Applications, 2019, vol. 72, issue 3, No 4, 609-640

Abstract: Abstract This work is about active set identification strategies aimed at accelerating block-coordinate descent methods (BCDM) applied to large-scale problems. We start by devising an identification function tailored for bound-constrained composite minimization together with an associated version of the BCDM, called Active BCDM, that is also globally convergent. The identification function gives rise to an efficient practical strategy for Lasso and $$\ell _1$$ ℓ 1 -regularized logistic regression. The computational performance of Active BCDM is contextualized using comparative sets of experiments that are based on the solution of problems with data from deterministic instances from the literature. These results have been compared with those of well-established and state-of-the-art methods that are particularly suited for the classes of applications under consideration. Active BCDM has proved useful in achieving fast results due to its identification strategy. Besides that, an extra second-order step was used, with favorable cost-benefit.

Keywords: Block coordinate descent; Active-set identification; Large-scale optimization; $$\ell _1$$ ℓ 1 Regularization; 60K05; 49M37; 90C30; 90C06; 90C25 (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10589-018-00056-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:72:y:2019:i:3:d:10.1007_s10589-018-00056-8

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-018-00056-8

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().