Higher Order Iteration Schemes for Unconstrained Optimization

HTML  Download Download as PDF (Size: 179KB)  PP. 73-83  
DOI: 10.4236/ajor.2011.13011    6,323 Downloads   10,790 Views  Citations

Affiliation(s)

.

ABSTRACT

Using a predictor-corrector tactic, this paper derives new iteration schemes for unconstrained optimization. It yields a point (predictor) by some line search from the current point; then with the two points it constructs a quadratic interpolation curve to approximate some ODE trajectory; it finally determines a new point (corrector) by searching along the quadratic curve. In particular, this paper gives a global convergence analysis for schemes associated with the quasi-Newton updates. In our computational experiments, the new schemes using DFP and BFGS updates outperformed their conventional counterparts on a set of standard test problems.

Share and Cite:

Y. Shi and P. Pan, "Higher Order Iteration Schemes for Unconstrained Optimization," American Journal of Operations Research, Vol. 1 No. 3, 2011, pp. 73-83. doi: 10.4236/ajor.2011.13011.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.