Abstract
The nine quadratically convergent algorithms for function minimization appearing in Ref. 2 are tested through several numerical examples. A quadratic function and four nonquadratic functions are investigated. For the quadratic function, the results show that, if high-precision arithmetic together with high accuracy in the one-dimensional search is employed, all the algorithms behave identically: they all produce the same sequence of points and they all lead to the minimal point in the same number of iterations (this number is equal at most to the number of variables). For the nonquadratic functions, the results show that some of the algorithms behave identically and, therefore, any one of them can be considered to be representative of the entire class. The effect of different restarting conditions on the convergence characteristics of the algorithms is studied. Proper restarting conditions for faster convergence are given.
Similar content being viewed by others
References
Huang, H. Y., andLevy, A. V.,Numerical Experiments on Quadratically Convergent Algorithms for Function Minimization, Rice University, Aero-Astronautics Report No. 66, 1969.
Huang, H. Y.,Unified Approach to Quadratically Convergent Algorithms for Function Minimization, Journal of Optimization Theory and Applications, Vol. 5, No. 6, 1970.
Rosenbrock, H. H.,An Automatic Method for Finding the Greatest or the Least Value of a Function, Computer Journal, Vol. 3, No. 3, 1960.
Pearson, J. D.,On Variable Metric Methods of Minimization, Research Analysis Corporation, Technical Paper No. RAC-TP-302, 1968.
Cragg, E. E., andLevy, A. V.,Study on a Supermemory Gradient Method for the Minimization of Functions, Journal of Optimization Theory and Applications, Vol. 4, No. 3, 1969.
Fletcher, R., andPowell, M. J. O.,A Rapidly Convergent Descent Method for Minimization, Computer Journal, Vol. 6, No. 2, 1963.
Author information
Authors and Affiliations
Additional information
Communicated by A. Miele
This research, supported by the Office of Scientific Research, Office of Aerospace Research, United States Air Force, Grant No. AF-AFOSR-828-67, is a condensation of the investigation described in Ref. 1.
Rights and permissions
About this article
Cite this article
Huang, H.Y., Levy, A.V. Numerical experiments on quadratically convergent algorithms for function minimization. J Optim Theory Appl 6, 269–282 (1970). https://doi.org/10.1007/BF00926604
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00926604