zbMATH — the first resource for mathematics

An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b). (English) Zbl 0548.65046
Summary: A modified version of the author’s original dynamic algorithm for unconstrained minimization is proposed [ibid. 6, 449-462 (1982; Zbl 0501.65026)]. It employs time step selection procedure which results in a more efficient utilization of the original dynamic algorithm. The performance of the new algorithm is compared with that of a well established conjugate gradient algorithm when applied to three different extended test functions. Based on a comparison of the respective CPU times required for convergence, the new algorithm appears to be competitive.

65K05 Numerical mathematical programming methods
90C30 Nonlinear programming
PDF BibTeX Cite
Full Text: DOI
[1] Snyman, J.A, A new and dynamic method for unconstrained minimization, Appl. math. modelling, 6, 449, (1982) · Zbl 0501.65026
[2] Snyman, J.A, A new convergent minimization method for functions with positive definite Hessian matrices, () · Zbl 0678.65042
[3] ()
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.