Abstract
A variety of realistic industrial problems can be constructed into quadratic programming (QP) problems, especially their time-varying versions. Zeroing neural network (ZNN) as a good approach for dynamic problems can solve QP problems subject to equality constraints in the past. In this work, we propose a unified predefined-time convergent and robust ZNN (PTCR-ZNN) model for solving time-varying QP (TVQP) 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 comparative simulations, 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.
Funding Information
  • National Key Research and Development Programs of China (2018YFB0203800)
  • National Natural Science Foundation of China (61625202, 61751204, 61860206011, 61866013, 61976089)
  • Natural Science Foundation of Hainan Province (2019JJ50478, 18A289)
  • Fundamental Research Funds for the Central Universities (531118010454)

This publication has 28 references indexed in Scilit: