首页 | 本学科首页   官方微博 | 高级检索  
     

一类求解退化凸二次规划的投影神经网络
引用本文:单彩虹,武怀勤. 一类求解退化凸二次规划的投影神经网络[J]. 五邑大学学报(自然科学版), 2009, 23(1): 57-62
作者姓名:单彩虹  武怀勤
作者单位:燕山大学,理学院,河北,秦皇岛,066004
摘    要:
借助变分不等式和Kuhn—Tucker条件,构造了一类投影神经网络求解线性约束的退化凸二次规划问题.与已有的求解退化凸规划问题的神经网络系统相比,系统的适用范围更广;在理论方面,系统是全局收敛的;数值实例显示了所得结论的有效性和正确性.

关 键 词:退化凸二次规划  投影神经网络  变分不等式  K-T条件  全局收敛

A Projection Neural Network for Solving the Degenerate Quadratic Program
SHAN Cai-hong,WU Huai-qin. A Projection Neural Network for Solving the Degenerate Quadratic Program[J]. Journal of Wuyi University(Natural Science Edition), 2009, 23(1): 57-62
Authors:SHAN Cai-hong  WU Huai-qin
Affiliation:(College of Science, Yanshan University, Qinhuangdao 066004, China)
Abstract:
By making use of variational inequality and Kuhn-Tucker conditions, we develop a projection neural network for solving degenerate quadratic programming problems with general linear constraints. Compared with the existing neural networks for solving degenerate convex quadratic program, the proposed neural network has a wider domain for implementation. In the theoretical aspects, the proposed neural network is shown to have global convergence. Illustrative examples show that the proposed neural network is effective and correct.
Keywords:degenerate convex quadratic program  projection neural network  variational inequality  Kuhn-Tucker conditions  global convergence
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号