Journal of the Korean Society for Industrial and Applied Mathematics
- Volume 9 Issue 1
- /
- Pages.55-61
- /
- 2005
- /
- 1226-9433(pISSN)
- /
- 1229-0645(eISSN)
MINIMIZATION OF EXTENDED QUADRATIC FUNCTIONS WITH INEXACT LINE SEARCHES
- Moghrabi, Issam A.R. (Department of Computer Science Faculty of Science Beirut Arab University)
- Published : 2005.06.25
Abstract
A Conjugate Gradient algorithm for unconstrained minimization is proposed which is invariant to a nonlinear scaling of a strictly convex quadratic function and which generates mutually conjugate directions for extended quadratic functions. It is derived for inexact line searches and for general functions. It compares favourably in numerical tests (over eight test functions and dimensionality up to 1000) with the Dixon (1975) algorithm on which this new algorithm is based.
Keywords