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


On the convergence of a class of algorithms using linearly independent search directions
Authors:Mokhtar S. Bazaraa  C. M. Shetty  Jamie J. Goode
Affiliation:(1) School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA;(2) School of Mathematics, Georgia Institute of Technology, Atlanta, GA, USA
Abstract:Powell has shown that the cyclic coordinate method with exact searches may not converge to a stationary point. In this note we consider a more general class of algorithms for unconstrained minimization, and establish their convergence under the assumption that the objective function has a unique minimum along any line.
Keywords:Cyclic Coordinate Method  Independent Search Directions  Cycling  Unconstrained Minimization
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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