A gradient-related algorithm with inexact line searches

详细信息    查看全文

• 作者：Shi ; Zhen-Jun ; Shen ; Jie
• 关键词：90C30 ; 65K05 ; 49M37 ; Unconstrained optimization ; Gradient-related algorithm ; Inexact line search ; Convergence
• 刊名：Journal of Computational and Applied Mathematics
• 出版年：2004
• 出版时间：September 15, 2004
• 年：2004
• 卷：170
• 期：2
• 页码：349-370
• 全文大小：299 K

文摘

In this paper, a new gradient-related algorithm for solving large-scale unconstrained optimization problems is proposed. The new algorithm is a kind of line search method. The basic idea is to choose a combination of the current gradient and some previous search directions as a new search direction and to find a step-size by using various inexact line searches. Using more information at the current iterative step may improve the performance of the algorithm. This motivates us to find some new gradient algorithms which may be more effective than standard conjugate gradient methods. Uniformly gradient-related conception is useful and it can be used to analyze global convergence of the new algorithm. The global convergence and linear convergence rate of the new algorithm are investigated under diverse weak conditions. Numerical experiments show that the new algorithm seems to converge more stably and is superior to other similar methods in many situations.