UNCONSTRAINED MINIMIZATION BY COMBINING THE DYNAMIC AND CONJUGATE GRADIENT METHODS
- 1 January 1985
- journal article
- research article
- Published by Taylor & Francis in Quaestiones Mathematicae
- Vol. 8 (1) , 33-42
- https://doi.org/10.1080/16073606.1985.9631898
Abstract
The author has recently developed a gradient-only dynamic method for unconstrained minimization. The main drawback of this method is, that in spite of rapid motion towards the neighbourhood of a local minimum, the final convergence is slow. To improve the situation the possibility of switching from the dynamic method to a conjugate qradient type method near the minimum is investigated. The Fletcher-Reeves conjugate gradient method is applied in a way in which only gradient evaluations are used by exploiting an Euler—trapezium integration scheme. The numerical results obtained are promising, indicating the combined method to be competitive for problems of high dimensionality and where the gradient evaluations are re1atively inexpensive.Keywords
This publication has 3 references indexed in Scilit:
- An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)Applied Mathematical Modelling, 1983
- A new and dynamic method for unconstrained minimizationApplied Mathematical Modelling, 1982
- Computed epitaxial monolayer structures: II. Two-dimensional model: Equilibrium monolayer structures in the case of rectangular interfacial symmetrySurface Science, 1974