Paper
26 September 2013 Group sparse optimization by alternating direction method
Wei Deng, Wotao Yin, Yin Zhang
Author Affiliations +
Abstract
This paper proposes efficient algorithms for group sparse optimization with mixed l2,1-regularization, which arises from the reconstruction of group sparse signals in compressive sensing, and the group Lasso problem in statistics and machine learning. It is known that encoding the group information in addition to sparsity can often lead to better signal recovery/feature selection. The l2,1-regularization promotes group sparsity, but the resulting problem, due to the mixed-norm structure and possible grouping irregularity, is considered more difficult to solve than the conventional l1-regularized problem. Our approach is based on a variable splitting strategy and the classic alternating direction method (ADM). Two algorithms are presented, one derived from the primal and the other from the dual of the l2,1-regularized problem. The convergence of the proposed algorithms is guaranteed by the existing ADM theory. General group configurations such as overlapping groups and incomplete covers can be easily handled by our approach. Computational results show that on random problems the proposed ADM algorithms exhibit good efficiency, and strong stability and robustness.
© (2013) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Wei Deng, Wotao Yin, and Yin Zhang "Group sparse optimization by alternating direction method", Proc. SPIE 8858, Wavelets and Sparsity XV, 88580R (26 September 2013); https://doi.org/10.1117/12.2024410
Lens.org Logo
CITATIONS
Cited by 217 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Algorithm development

Tolerancing

Radon

Matrices

Reconstruction algorithms

Algorithms

Compressed sensing

RELATED CONTENT


Back to Top