Modeling and Verification of Zhang Neural Networks for Online Solution of Time-Varying Quadratic Minimization and Programming

Authors:
Yunong Zhang;Xuezhong Li;Zhan Li
Affiliations:
School of Information Science and Technology,;School of Software, Sun Yat-Sen University (SYSU), Guangzhou, China 510275;School of Information Science and Technology,
Venue:
ISICA '09 Proceedings of the 4th International Symposium on Advances in Computation and Intelligence
Year:
2009

Citing 6
Cited 0

Convex Optimization

Convex Optimization
Zhang Neural Network Versus Gradient Neural Network for Online Time-Varying Quadratic Function Minimization

ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence
Simulink Modeling and Comparison of Zhang Neural Networks and Gradient Neural Networks for Time-Varying Lyapunov Equation Solving

ICNC '08 Proceedings of the 2008 Fourth International Conference on Natural Computation - Volume 03
A recurrent neural network for solving Sylvester equation with time-varying coefficients

IEEE Transactions on Neural Networks
Design and analysis of a general recurrent neural network model for time-varying matrix inversion

IEEE Transactions on Neural Networks
Quasi-Lagrangian Neural Network for Convex Quadratic Optimization

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, by following Zhang et al 's neural-dynamic method proposed formally since March 2001, two recurrent neural networks are generalized to solve online the time-varying convex quadratic-minimization and quadratic-programming (QP) problems, of which the latter is subject to a time-varying linear-equality constraint as an example. In comparison with conventional gradient-based neural networks or gradient neural networks (GNN), the resultant Zhang neural networks (ZNN) can be unified as a superior approach for solving online the time-varying quadratic problems. For the purpose of time-varying quadratic-problems solving, this paper investigates comparatively both ZNN and GNN solvers, and then their unified modeling techniques. The modeling results substantiate well the efficacy of such ZNN models on solving online the time-varying convex QP problems.