Neurodynamics-based Iteratively Reweighted Convex Optimization for Sparse Signal Reconstruction

In this paper, sparse signal reconstruction is for-mulated a q-ratio minimization problem subjecting to linear underdetermined equations. In view of the nonconvexity of the objective function, the q-ratio formulation with
$q=2$
is approximately reformulated as an iteratively reweighted convex optimization problem in the majorization-minimization frame-work. A neurodynamic optimization approach is introduced to solve the formulated problem iteratively. The experimental results on sparse signal reconstruction are discussed to demonstrate the performance of the proposed approach.