A Unified Predefined-Time Convergent and Robust ZNN Model for Constrained Quadratic Programming

摘要

A variety of realistic industrial problems can be constructed into quadratic programming (QP) problems, especially their time-varying versions. A zeroing neural network (ZNN) as a good approach for dynamic problems can solve QP problems subject to equality constraints in the past. In this article, we propose a unified predefined-time convergent and robust ZNN (PTCR-ZNN) model for solving time-varying QP problems subject to equality or inequality constraints. Compared with the normal ZNN model, the PTCR-ZNN model mainly has advantages in the following three aspects: 1) solving QP problems with or without inequality constraints in a unified model; 2) converging to the optimal solution of QP problems within a predefined time that can be determined in advance; and 3) resisting many external noises with tiny and predictable residual error. These improvements have been rigorously proved in theory. By conducting both qualitative and quantitative simulations with comparisons, the superior properties of the PTCR-ZNN model are further validated. Finally, the application of the PTCR-ZNN model to image fusion task illustrates the efficiency together with its applicability.