求解二次规划问题的离散时间神经网络的收敛性分析

Lu, Yang and Yugeng, XI and Jianbo, LU (2012) 求解二次规划问题的离散时间神经网络的收敛性分析. Journal of Systems Science and Mathematical Sciences, 32 (11). pp. 1343-1353.

Full text not available from this repository.

Abstract

The convergence property of discrete-time neural network for quadratic programming is analyzed. By choosing a proper Lyapunov function, a sufficient ondition for global convergence is obtained. The convergence rate under the condition is also investigated through a in-depth discussion about full-row-rank inequality constraint left matrix condition nd non-full-row-rank inequality constraint left matrix condition, respectively, and the exponential convergence property for both full-row rank and non-full-row rank inequality constraint left matrix conditions under the mentioned sufficient condition is proved. Simulation result verifies the validity of the theoretical results obtained in this paper. CLC Number:

Item Type:
Journal Article
Journal or Publication Title:
Journal of Systems Science and Mathematical Sciences
ID Code:
172570
Deposited By:
Deposited On:
12 Jul 2022 09:35
Refereed?:
Yes
Published?:
Published
Last Modified:
12 Jul 2022 09:35