PROJECT TITLE :
Improved analysis of greedy block coordinate descent under RIP
A more relaxed condition means that fewer of measurements are needed to ensure the precise sparse recovery from the theoretical facet. The sufficient condition for the greedy block coordinate descent (GBCD) algorithm is relaxed using the close to-orthogonality property. It's additionally shown that the GBCD algorithm fails when (one/(√K+1)≤δK+1<;1).
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here