Modeling and verification of Zhang neural networks for online solution of time-varying quadratic minimization and programming

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. © Springer-Verlag 2009.