Abstract
In this paper, combining the feasible direction method with the conjugate gradient method, we propose a feasible Fletcher–Reeves conjugate gradient method for solving linear equality constrained optimization problem. The directions generated by the method are feasible and descent for the objective function. Under mild conditions, we show that the proposed method with exact line search is globally convergent. Numerical experiments are also given to show the efficiency of the method.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
