Operations Research Transactions ›› 2023, Vol. 27 ›› Issue (1): 103-114.doi: 10.15960/j.cnki.issn.1007-6093.2023.01.007

Previous Articles     Next Articles

Recurrent neural network dynamic for time-varying convex quadratic programming

Wudai LIAO1, Jun ZHOU1,*()   

  1. 1. School of Electronic and Information, Zhongyuan University of Technology, Zhengzhou 451191, Henan, China
  • Received:2020-10-22 Online:2023-03-15 Published:2023-03-16
  • Contact: Jun ZHOU E-mail:jz970077409@sina.com

Abstract:

When solving a time-varying convex quadratic programming problem online, in order to achieve the requirements of higher error accuracy, shorter solution time and faster convergence speed, this paper designs and constructs an improved zeroing neurodynamic model of the design parameters of the time-varying network. Firstly, the Lyapunov stability theory proves that the network model is globally progressively stable. Subsequently, it is proved that when it uses the Sign-bi-power activation function, it is guaranteed that its solution can converge for a finite time. Finally, in the simulation example, compared with the gradient neural network model and the zeroing neural network model, the zeroing neurodynamics of the time-varying network design parameters is better than the two network models in solving the time-convex quadratic programming problem, with higher error accuracy, shorter solution time and faster convergence speed.

Key words: time-varying convex quadratic programming, improved zeroing dynamic model, Sign-bi-power

CLC Number: