A Unified Predefined-Time Convergent and Robust ZNN Model for Constrained Quadratic Programming
- 21 May 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 17 (3) , 1998-2010
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.Keywords
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:
- A novel neural network for solving convex quadratic programming problems subject to equality and inequality constraintsNeurocomputing, 2016
- ZNN for solving online time-varying linear matrix–vector inequality via equality conversionApplied Mathematics and Computation, 2015
- Li-function activated ZNN with finite-time convergence applied to redundant-manipulator kinematic control via time-varying Jacobian matrix pseudoinversionApplied Soft Computing, 2014
- A neural network model for solving convex quadratic programming problems with some applicationsEngineering Applications of Artificial Intelligence, 2014
- A Gradient-Based Neural Network Method for Solving Strictly Convex Quadratic Programming ProblemsCognitive Computation, 2014
- Accelerating a Recurrent Neural Network to Finite-Time Convergence for Solving Time-Varying Sylvester Equation by Using a Sign-Bi-power Activation FunctionNeural Processing Letters, 2012
- Zhang neural network versus gradient-based neural network for time-varying linear matrix equation solvingNeurocomputing, 2011
- Improved gradient-based neural networks for online solution of Lyapunov matrix equationInformation Processing Letters, 2011
- Robustness analysis of the Zhang neural network for online time-varying quadratic optimizationJournal of Physics A: Mathematical and Theoretical, 2010
- A new gradient-based neural network for solving linear and quadratic programming problemsIEEE Transactions on Neural Networks, 2001