Dynamical Sparse Recovery with Finite-time Convergence
Abstract
Even though Sparse Recovery (SR) has been successfully applied in a wide range of research communities, there still exists a barrier to real applications because of the inefficiency of the state-of-the-art algorithms. In this paper, we propose a dynamical approach to SR which is highly efficient and with finite-time convergence property. Firstly, instead of solving the ℓ1 regularized optimization programs that requires exhausting iterations, which is computer-oriented, the solution to SR problem in this work is resolved through the evolution of a continuous dynamical system which can be realized by analog circuits. Moreover, the proposed dynamical system is proved to have the finite-time convergence property, and thus more efficient than LCA (the recently developed dynamical system to solve SR) with exponential convergence property. Consequently, our proposed dynamical system is more appropriate than LCA to deal with the time-varying situations. Simulations are carried out to demonstrate the superior properties of our proposed system.
Origin | Files produced by the author(s) |
---|
Loading...