DocumentCode
2473262
Title
A feasible fletcher-reeves method to linear equality constrained optimization problem
Author
Li, Can ; Fang, Ling ; Cui, Xiangzhao
Author_Institution
Coll. of Math., Honghe Univ., Mengzi, China
fYear
2010
fDate
17-19 Dec. 2010
Firstpage
30
Lastpage
33
Abstract
In this paper, the conjugate gradient method for solving unconstrained optimization problem is applied to linear equality constrained optimization problem. An attractive property of the proposed method is that the generated direction is always feasible and descent direction, and this property is independent of the line search used. Under mild conditions, we prove that the method with Armijo-type line search is globally convergent. Numerical experiments are also given which show the efficient of the method.
Keywords
conjugate gradient methods; linear programming; Armijo-type line search; Fletcher-Reeves method; conjugate gradient method; linear equality constrained optimization problem; unconstrained optimization problem; Convergence; Gradient methods; Nickel; Noise measurement; Programming; Armijo-type line search; Feasible FR method; Linear equality constrained optimization problem; global convergence;
fLanguage
English
Publisher
ieee
Conference_Titel
Apperceiving Computing and Intelligence Analysis (ICACIA), 2010 International Conference on
Conference_Location
Chengdu
Print_ISBN
978-1-4244-8025-8
Type
conf
DOI
10.1109/ICACIA.2010.5709844
Filename
5709844
Link To Document