arXiv · 2310.19012
An ADMM Algorithm for a Generic $\ell_0$ Sparse Overlapping Group Lasso Problem
Abstract
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.
Explore related subjects
Keep this discovery
Youming Zhao. 2023-10-29. An ADMM Algorithm for a Generic $\ell_0$ Sparse Overlapping Group Lasso Problem. https://arxiv.org/abs/2310.19012
Cite the original work for its findings. Save a collection to share your selection of sources.