Improved analysis of greedy block coordinate descent under RIP
Li H.
Ma Yingbin
Liu WenAn
Fu Yuli
· 2015
期刊名称：
Electronics Letters
2015 年
51 卷
6 期
摘要：
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)?‰???
会员登录
