Share Email Print

Proceedings Paper

Group sparse optimization by alternating direction method
Author(s): Wei Deng; Wotao Yin; Yin Zhang
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 26 September 2013
PDF: 15 pages
Proc. SPIE 8858, Wavelets and Sparsity XV, 88580R (26 September 2013); doi: 10.1117/12.2024410
Show Author Affiliations
Wei Deng, Rice Univ. (United States)
Wotao Yin, Rice Univ. (United States)
Yin Zhang, Rice Univ. (United States)

Published in SPIE Proceedings Vol. 8858:
Wavelets and Sparsity XV
Dimitri Van De Ville; Vivek K. Goyal; Manos Papadakis, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?