Abstract
Convergence speed is one of the most considerable features for sparse signal reconstruction algorithms. This paper introduces several novel fast time-varying neurodynamic optimization approaches (TVNOAs) with fixed-time convergence for sparse signal reconstruction. It is demonstrated that these trajectories converge to solutions within a fixed-time from arbitrary initial conditions, exhibiting a faster convergence rate due to the selection of appropriate time-varying coefficients. The fixed-time convergence of the proposed TVNOAs is investigated using the Polyak–Lojasiewicz condition. Moreover, explicit upper bounds for the settling time of TVNOAs are provided. Additionally, the robustness under bounded noises is further examined. Numerical experiments on sparse signal reconstruction validate the superiority of the proposed neurodynamic approaches.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.