Home > Research > Publications & Outputs > 求解二次规划问题的离散时间神经网络的收敛性分析

Links

Text available via DOI:

View graph of relations

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

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

求解二次规划问题的离散时间神经网络的收敛性分析. / Lu, Yang; Yugeng, XI; Jianbo, LU.
In: Journal of Systems Science and Mathematical Sciences, Vol. 32, No. 11, 30.11.2012, p. 1343-1353.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Lu, Y, Yugeng, XI & Jianbo, LU 2012, '求解二次规划问题的离散时间神经网络的收敛性分析', Journal of Systems Science and Mathematical Sciences, vol. 32, no. 11, pp. 1343-1353. https://doi.org/10.12341/jssms11991

APA

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

Vancouver

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

Author

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

Bibtex

@article{706635e2803e44c5af7c4bb538c693b4,
title = "求解二次规划问题的离散时间神经网络的收敛性分析",
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 resultverifies the validity of the theoretical results obtained in this paper.CLC Number: ",
author = "Yang Lu and XI Yugeng and LU Jianbo",
year = "2012",
month = nov,
day = "30",
doi = "10.12341/jssms11991",
language = "Chinese (Simplified)",
volume = "32",
pages = "1343--1353",
journal = "Journal of Systems Science and Mathematical Sciences",
number = "11",

}

RIS

TY - JOUR

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

AU - Lu, Yang

AU - Yugeng, XI

AU - Jianbo, LU

PY - 2012/11/30

Y1 - 2012/11/30

N2 - 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 resultverifies the validity of the theoretical results obtained in this paper.CLC Number:

AB - 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 resultverifies the validity of the theoretical results obtained in this paper.CLC Number:

U2 - 10.12341/jssms11991

DO - 10.12341/jssms11991

M3 - Journal article

VL - 32

SP - 1343

EP - 1353

JO - Journal of Systems Science and Mathematical Sciences

JF - Journal of Systems Science and Mathematical Sciences

IS - 11

ER -