On the Speed of Convergence of gen-OMP Algorithm under RIP Conditions

Following the program of translation of algorithmic problems into a dynamical system setup, we investigate the bounds for a gen-OMP algorithm in the terms of iterates of a piecewise affine one dimensional map. OMP algorithms are greedy methods for sparse signal recovery or approximation from random measurements. They originate from the signal-processing community and have also been popular in the domains of function approximation, statistics and machine learning.

By: Aurélie Lozano, Tomasz Nowicki, Grzegorz Swirszcz

Published in: RC25552 in 2015


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to reports@us.ibm.com .