Efficient block-coordinate descent algorithms for the Group Lasso

@article{Qin2013EfficientBD,
title={Efficient block-coordinate descent algorithms for the Group Lasso},
author={Zhiwei Qin and Katya Scheinberg and Donald Goldfarb},
journal={Math. Program. Comput.},
year={2013},
volume={5},
pages={143-169}
}
We present two algorithms to solve the Group Lasso problem [33]. First, we propose a general version of the Block Coordinate Descent (BCD) algorithm for the Group Lasso that employs an efficient approach for optimizing each subproblem exactly. We show that it exhibits excellent performance when the groups are of moderate size. For groups of large size, we propose an extension of ISTA/FISTA [2] based on variable step-lengths that can be viewed as a simplified version of BCD. By combining the two… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 147 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 82 extracted citations

Large-scale Feature Selection of Risk Genetic Factors for Alzheimer's Disease via Distributed Group Lasso Regression

ArXiv • 2017
View 12 Excerpts
Highly Influenced

Towards ultrahigh dimensional feature selection for big data

Journal of Machine Learning Research • 2014
View 13 Excerpts
Highly Influenced

A Compact Formulation for the $\ell _{2,1}$ Mixed-Norm Minimization Problem

IEEE Transactions on Signal Processing • 2018
View 4 Excerpts
Highly Influenced

Learning Discriminative Dictionary for Group Sparse Representation

IEEE Transactions on Image Processing • 2014
View 4 Excerpts
Highly Influenced

GROUP SPARSE OPTIMIZATION BY ALTERNATING DIRECTION METHOD Report Title

2012
View 4 Excerpts
Highly Influenced

Towards Large-scale and Ultrahigh Dimensional Feature Selection via Feature Generation

ArXiv • 2012
View 11 Excerpts
Highly Influenced

Group Sparse Optimization by Alternating Direction Method

2011
View 4 Excerpts
Highly Influenced

Human Motion Segmentation via Robust Kernel Sparse Subspace Clustering

IEEE Transactions on Image Processing • 2018
View 3 Excerpts
Highly Influenced

Image Denoising Using Low-Rank Dictionary and Sparse Representation

2014 Tenth International Conference on Computational Intelligence and Security • 2014
View 3 Excerpts
Highly Influenced

A Block Fixed Point Continuation Algorithm for Block-Sparse Reconstruction

IEEE Signal Processing Letters • 2012
View 7 Excerpts
Highly Influenced

147 Citations

Citations per Year
Semantic Scholar estimates that this publication has 147 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 34 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

SIAM J. Imaging Sciences • 2009
View 16 Excerpts
Highly Influenced

Group Sparsity via Linear-time Projection

EWOUT, +3 authors Kevin Murphy
2008
View 13 Excerpts
Highly Influenced

Sparse Optimization with Least-Squares Constraints

SIAM Journal on Optimization • 2011
View 12 Excerpts
Highly Influenced

A coordinate gradient descent method for nonsmooth separable minimization

Math. Program. • 2009
View 9 Excerpts
Highly Influenced

Model selection and estimation in regression with grouped variables

View 10 Excerpts
Highly Influenced

Benchmarking Optimization Software with Performance Profiles

Math. Program. • 2002
View 3 Excerpts
Highly Influenced

SLEP : Sparse Learning with Efficient Projections

2009
View 6 Excerpts
Highly Influenced

Sparse Reconstruction by Separable Approximation

IEEE Transactions on Signal Processing • 2008
View 7 Excerpts
Highly Influenced

The group lasso for logistic regression

View 5 Excerpts
Highly Influenced

Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function

Math. Program. • 2014
View 1 Excerpt