Recovering Data with Group Sparsity by Alternating Direction Methods

Files in this item

Files Size Format View
DENG-THESIS.pdf 684.9Kb application/pdf Thumbnail

Show full item record

Item Metadata

Title: Recovering Data with Group Sparsity by Alternating Direction Methods
Author: Deng, Wei
Advisor: Zhang, Yin; Yin, Wotao
Degree: Master of Arts thesis
Abstract: Group sparsity reveals underlying sparsity patterns and contains rich structural information in data. Hence, exploiting group sparsity will facilitate more efficient techniques for recovering large and complicated data in applications such as compressive sensing, statistics, signal and image processing, machine learning and computer vision. This thesis develops efficient algorithms for solving a class of optimization problems with group sparse solutions, where arbitrary group configurations are allowed and the mixed L21-regularization is used to promote group sparsity. Such optimization problems can be quite challenging to solve due to the mixed-norm structure and possible grouping irregularities. We derive algorithms based on a variable splitting strategy and the alternating direction methodology. Extensive numerical results are presented to demonstrate the efficiency, stability and robustness of these algorithms, in comparison with the previously known state-of-the-art algorithms. We also extend the existing global convergence theory to allow more generality.
Citation: Deng, Wei. (2012) "Recovering Data with Group Sparsity by Alternating Direction Methods." Masters Thesis, Rice University.
Date: 2012-09-05

This item appears in the following Collection(s)