• A MODIFIED CG-METHOD WITH A NEW LINE SEARCH PROCEDURE, PART I; THEORETICAL MOTIVATION

Runak M. Abdullah, Abbas Y. Al Bayati*

Abstract


In this paper a new modified class of CG-methods for solving unconstrained nonlinear optimization problem is proposed. Here, we have suggested a new formula for the line search approach suitable for the convex functions (namely; non-monotonic line search procedure) with some important theoretical investigations as a part I of this work.

Keywords


Unconstrained Optimization, Conjugate Gradient, Non-Monotonic Line search, Convex Functions.

Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2020 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
Web Counter