By Topic

A feasible fletcher-reeves method to linear equality constrained optimization problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Can Li ; Coll. of Math., Honghe Univ., Mengzi, China ; Ling Fang ; Xiangzhao Cui

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.

Published in:

Apperceiving Computing and Intelligence Analysis (ICACIA), 2010 International Conference on

Date of Conference:

17-19 Dec. 2010