An ADMM Algorithm for a Generic $\ell_0$ Sparse Overlapping Group Lasso Problem
We present an alternating direction method of multipliers (ADMM) for a generic overlapping group lasso problem, where the groups can be overlapping in an arbitrary way. Meanwhile, we prove the lower bounds and upper bounds for both the $\ell_1$ sparse group lasso problem and the $\ell_0$ sparse grou...
Saved in:
Main Author | |
---|---|
Format | Journal Article |
Language | English |
Published |
29.10.2023
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | We present an alternating direction method of multipliers (ADMM) for a
generic overlapping group lasso problem, where the groups can be overlapping in
an arbitrary way. Meanwhile, we prove the lower bounds and upper bounds for
both the $\ell_1$ sparse group lasso problem and the $\ell_0$ sparse group
lasso problem. Also, we propose the algorithms for computing these bounds. |
---|---|
DOI: | 10.48550/arxiv.2310.19012 |