A generalized varying-parameter recurrent neural network for super solution of quadratic programming problem

Abstract

To obtain superior convergent speed, a generalized varying-parameter recurrent neural network (GVP-RNN) is established and analyzed for solving quadratic programming (QP) problems. Different from the classical fix-parameter neural network, such as Zhang neural network (ZNN) and finite-time convergent differential neural network (FT-CDNN), GVP-RNN dynamics can achieve exponential convergent results and possess high precision. By Lagrange theorem, QP problems can be transformed to a time-varying matrix equation, which is prepared for the GVP-RNN model. Theoretical analysis has shown the GVP-RNN model takes a super-exponential convergence comparing the corresponding simulated results of ZNN and FT-CDNN. Simulation comparisons are presented to evaluate the theoretical performance of the GVP-RNN with three types of activation functions. Furthermore, the proposed GVP-RNN model is analyzed and applied to control kinematic trajectory of redundant manipulators.