
doi: 10.1049/el.2012.3923
Greedy algorithms are computationally efficient optimisation techniques for solving sparse recovery problems. Matching pursuit (MP) and orthogonal MP (OMP) are popular greedy algorithms; MP possesses the lowest complexity whereas OMP provides better performance. In this reported work, OMP is modified using dichotomous coordinate descent (DCD) iterations and an algorithm is arrived at that has performance close to that of OMP and complexity even lower than that of MP.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 9 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
