Title :
Improved analysis of greedy block coordinate descent under RIP
Author :
Haifeng Li ; Yingbin Ma ; WenAn Liu ; Yuli Fu
Author_Institution :
Coll. of Math. & Inf. Sci., Henan Normal Univ., Xinxiang, China
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).
Keywords :
direction-of-arrival estimation; sparse matrices; DOA estimation; GBCD algorithm; MMV model; RIP; greedy block coordinate descent; multiple measurements vectors; near-orthogonality property; restricted isometry property; sparse recovery; sufficient condition;
Journal_Title :
Electronics Letters
DOI :
10.1049/el.2014.3756
