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

A NEW SUFFICIENT CONDITION FOR THE CONVERGENCE OF THE DFP ALGORITHM WITH WOLFE LINE SEARCH
作者姓名:XU  Dachuan
作者单位:XU Dachuan(Department of Mathematics,Qufu Normal University,Qufu 273165,China)LIU Guanghui(Institute of Applied Mathematics,Academia Sinica,Beijing 100080,China)
摘    要:ANEWSUFFICIENTCONDITIONFORTHECONVERGENCEOFTHEDFPALGORITHMWITHWOLFELINESEARCH¥XUDachuan(DepartmentofMathematics,QufuNormalUniv...


A NEW SUFFICIENT CONDITION FOR THE CONVERGENCE OF THE DFP ALGORITHM WITH WOLFE LINE SEARCH
XU Dachuan.A NEW SUFFICIENT CONDITION FOR THE CONVERGENCE OF THE DFP ALGORITHM WITH WOLFE LINE SEARCH[J].Journal of Systems Science and Complexity,1996(3).
Authors:XU Dachuan
Abstract:The DFP algorithm is one of the mest famous numerical algorithms for unconstrained optimization.It is an open problem whether DFP algorithm with inexact line searches is globally convergent. In this paper, we propose a sufficient condition for theconvergence of the DFP algorithm with Wolfe line search on uniformly convex objective function.
Keywords:Global convergence  DFP algorithm  Wolfe line Search
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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