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

解互补问题的—类广义拟牛顿算法
引用本文:蔡华良,朱红兰. 解互补问题的—类广义拟牛顿算法[J]. 中国西部科技, 2009, 8(7): 95-96
作者姓名:蔡华良  朱红兰
作者单位:淮阴工学院计算科学系,江苏淮安225003
基金项目:淮阴工学院基金资助项目(HGQN0725).
摘    要:
互补问题在实际生活中有着广泛的应用,是当前研究的一个热点问题,从而产生了很多的解决途径。本文利用互补函数将互补问题转化为一个无约束最优化问题,从而构造了一类求解互补问题的广义拟牛顿算法,并从理论上给出了无约束最优化问题的解是原互补问题解的一个充分条件。数值实验表明算法不仅可行而且效果较好。

关 键 词:互补问题  无约束最优化  广义拟牛顿算法

A Class of Generalized Quasi-Newton Methods for Solving Complementarity Problems
CAI Hua-liang,ZHU Hong-lan. A Class of Generalized Quasi-Newton Methods for Solving Complementarity Problems[J]. Science and Technology of West China, 2009, 8(7): 95-96
Authors:CAI Hua-liang  ZHU Hong-lan
Affiliation:(D epartment of computing science, Huaivin Institute of Technology, Huaian 223003, China)
Abstract:
Complementarity problem has been the hotspot in the research of mathematical programming and many methods have been proposed.In this paper,complementarity problem is convert into unconstrained optimization by using complementarity function.It is also proved that the solution of unconstrained optimization is that of the complemetarity problems.Numerical experiments indicate that the new method is feasible and efficient.
Keywords:Complementarity problem  Unconstrained Optimization  Generalized Quasi-Newton Algorithm
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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