Abstract

This paper develops two continuous-time distributed accelerated neurodynamic approaches for solving sparse recovery via smooth approximation to L1-norm minimization problem. First, the L1-norm minimization problem is converted into a distributed smooth optimization problem by utilizing multiagent consensus theory and smooth approximation. Then, a distributed primal–dual accelerated neurodynamic approach is designed by using Karush–Kuhn–Tucker (KKT) condition and Nesterov’s accelerated method. Furthermore, in order to reduce the structure complexity of the presented neurodynamic approach, based on the projection matrix, we eliminate a dual variable in the KKT condition and propose a distributed accelerated neurodynamic approach with a simpler structure. It is proved that the two proposed distributed neurodynamic approaches both achieve O(1t2) convergence rate. Finally, the simulation results of sparse recovery are given to demonstrate the effectiveness of the proposed approaches.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.