DocumentCode
581962
Title
A new family sufficient descent conjugate gradient methods for unconstrained optimization
Author
Sun, Zhongbo ; Zhu, Tianxiao ; Weng, Shiyou ; Gao, Haiyin
Author_Institution
Coll. of Humanities & Sci., Northeast Normal Univ., Changchun, China
fYear
2012
fDate
25-27 July 2012
Firstpage
2532
Lastpage
2536
Abstract
In this paper, a new family modified descent conjugate gradient methods are proposed for solving unconstrained optimization problems. We develop a new sufficient descent direction at every iteration. Under some suitable conditions, theoretical analysis shows that the algorithm is global convergence. Numerical results show that this method is effective in unconstrained minimizing optimization problems.
Keywords
conjugate gradient methods; convergence of numerical methods; iterative methods; minimisation; Unconstrained Optimization; family-modified sufficient descent conjugate gradient methods; global convergence; iterations; sufficient descent direction; theoretical analysis; unconstrained minimizing optimization problems; Convergence; Educational institutions; Electronic mail; Gradient methods; Logic gates; Nickel; conjugate gradient method; sufficient descent direction; unconstrained minimizing optimization problems;
fLanguage
English
Publisher
ieee
Conference_Titel
Control Conference (CCC), 2012 31st Chinese
Conference_Location
Hefei
ISSN
1934-1768
Print_ISBN
978-1-4673-2581-3
Type
conf
Filename
6390351
Link To Document