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

无约束优化问题线搜索方法的收敛性
引用本文:王洪芹,时贞军.无约束优化问题线搜索方法的收敛性[J].济南大学学报(自然科学版),2005,19(3):281-281.
作者姓名:王洪芹  时贞军
作者单位:曲阜师范大学,运筹与管理学院,山东,日照,276826;曲阜师范大学,运筹与管理学院,山东,日照,276826
基金项目:国家自然科学基金资助项目(10171055)
摘    要:在较弱条件下给出了5种线搜索准则下的线搜索方法的收敛结论,这些结论对于构造快速有效的收敛算法是十分有用的。表明了搜索方向在这些方法中起主要作用,同时步长在一定条件下保证了算法的全局收敛性。说明了算法可用于求解更广泛的无约束优化问题。

关 键 词:无约束最优化  线搜索方法  全局收敛性
文章编号:1671-3559(2005)03-0281-01
修稿时间:2005年3月31日

Convergence of Line Search Methods for Unconstrained Optimization
WANG Hong-qin,SHI Zhen-jun.Convergence of Line Search Methods for Unconstrained Optimization[J].Journal of Jinan University(Science & Technology),2005,19(3):281-281.
Authors:WANG Hong-qin  SHI Zhen-jun
Abstract: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.
Keywords:unconstrained optimization  line search method  global convergence
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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