Analysis of convergence for the alternating direction method applied to joint sparse recovery

Anping Liao, Xiaobo Yang, Jiaxin Xie and Yuan Lei

Applied Mathematics and Computation, 2015, vol. 269, issue C, 548-557

Abstract: The sparse representation of a multiple measurement vector (MMV) is an important problem in compressed sensing theory, the old alternating direction method (ADM) is an optimization algorithm that has recently become very popular due to its capabilities to solve large-scale or distributed problems. The MMV–ADM algorithm to solve the MMV problem by ADM has been proposed by H. Lu, et al. (2011)[24], but the theoretical result about the convergence of matrix iteration sequence generated by the algorithm is left as a future research topic. In this paper, based on the subdifferential property of the two-norm for vector, a shrink operator associated with matrix is established. By using the operator, a convergence theorem is proved, which shows the MMV–ADM algorithm can recover the jointly sparse vectors.

Keywords: Compressed sensing; Multiple measurement vectors; Joint sparsity; Row sparse matrices; Sparse recovery; Alternating direction method (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300315010267
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:269:y:2015:i:c:p:548-557

DOI: 10.1016/j.amc.2015.07.104

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().