Improved analysis of greedy block coordinate descent under RIP. Issue 6 (1st March 2015)

• Record Type: Journal Article
• Authors: Li, Haifeng; Ma, Yingbin; Liu, WenAn; Fu, Yuli
• Is Part Of: Electronics letters. Volume 51:Issue 6(2015)
• Page Start: 488
• Page End: 490
• Publication Date: 2015-03-01
• Subjects: direction‐of‐arrival estimation -- sparse matrices; sparse recovery -- restricted isometry property -- sufficient condition -- greedy block coordinate descent -- near‐orthogonality property -- GBCD algorithm -- RIP -- DOA estimation -- multiple measurements vectors -- MMV model; Electronics -- Periodicals; 621.381
• DOI: 10.1049/el.2014.3756
• Languages: English
• ISSNs: 0013-5194

Abstract

Abstract : A more relaxed condition means that fewer of measurements are needed to ensure the exact sparse recovery from the theoretical aspect. The sufficient condition for the greedy block coordinate descent (GBCD) algorithm is relaxed using the near‐orthogonality property. It is also shown that the GBCD algorithm fails when (1/(√ K +1)≤δ K+1 <1).