一类新型DL共轭梯度法研究  

A NEW DL-TYPE CONJUGATE GRADIENT METHOD FOR NONCONVEX UNCONSTRAINED OPTIMIZATION PROBLEMS

作　　者：邓松海[1] 万中[1] 

机构地区：[1]中南大学数学与统计学院,长沙410083

出　　处：《计算数学》2012年第3期297-308,共12页Mathematica Numerica Sinica

基　　金：国家自然科学基金资助(基金号:71071162;70921001)

摘　　要：提出了求解无约束优化问题的新型DL共轭梯度方法.同已有方法不同之处在于,该方法构造了一种修正的Armijo线搜索规则,它不仅能给出当前迭代步步长,而且还能同时确定计算下一步搜索方向时需要用到的共轭参数值.在较弱的条件下,建立了算法的全局收敛性理论.数值试验表明,新型共轭梯度算法比同类方法具有更好的计算效率.In this paper, a new DL-type conjugate gradient method is proposed for solving noncon- vex unconstrained optimization problems. Different from the existent ones, a new modified Armijo-type line search rule is constructed to give both the steplength and the conjugated parameter being used to determine a search direction in the mean time at each iteration. Under weak conditions, the global convergence of the developed algorithm is established. Numerical experiments show the efficiency of the algorithm, particularly in comparison with the similar ones available in the literature.

关 键 词：无约束规划 共轭梯度 全局收敛 非精确线性搜索 下降算法 

分 类 号：O224[理学—运筹学与控制论]