LAUSR

Abstract Zeroing neural network (ZNN, or termed Zhang neural network after its inventor), being a special type of neurodynamic methodology, has shown powerful abilities to solve a great variety of time-varying problems with monotonically increasing odd activation functions. However, the existing results on ZNN cannot handle the inequality constraint in the optimization problem and nonconvex function cannot applied to accelerating the convergence speed of ZNN. This work breaks these limitations by proposing ZNN models, allowing nonconvex sets for projection operations in activation functions and incorporating new techniques for handing inequality constraint arising in optimizations. Theoretical analyses reveal that the proposed ZNN models are of global stability with timely convergence. Finally, illustrative simulation examples are provided and analyzed to substantiate the efficacy and superiority of the proposed ZNN models for real-time dynamic quadratic programming subject to equality and inequality constraints.