无约束优化问题线搜索方法的收敛性  

Convergence of Line Search Methods for Unconstrained Optimization

作　　者：王洪芹[1] 时贞军[1] 

机构地区：[1]曲阜师范大学运筹与管理学院,山东日照276826

出　　处：《济南大学学报（自然科学版）》2005年第3期281-281,共1页Journal of University of Jinan(Science and Technology)

基　　金：国家自然科学基金资助项目(10171055)

摘　　要：在较弱条件下给出了5种线搜索准则下的线搜索方法的收敛结论,这些结论对于构造快速有效的收敛算法是十分有用的。表明了搜索方向在这些方法中起主要作用,同时步长在一定条件下保证了算法的全局收敛性。说明了算法可用于求解更广泛的无约束优化问题。Line search methods are traditional and successful methods for unconstrained optimization problems. Its convergence has attracted more attentions in recent years. In this paper, we analyze the general results on convergence of line search methods with five line search rules. It is clarified that the search direction plays a key role in these methods and that step-size guarantees the global convergence in some cases. We obtain the same convergence results under some weaker conditions. These convergence results can make us design powerful, effective, and stable algorithms to solve much more unconstrained optimization problems.

关 键 词：无约束最优化 线搜索方法 全局收敛性 

分 类 号：O221.2[理学—运筹学与控制论]