Abstract
This contribution contains a description of a new class of methods for unconstrained minimization, which are combination of variable metric methods and a method proposed by Charalambous (1973). These methods are very efficient and their efficiency is demonstrated on standard test functions.
Zusammenfassung
Dieser Beitrag enthält die Beschreibung einer neuen Klasse von Methoden für die Minimierung ohne Restriktionen, welche die Methoden mit variabler Metrik und die von Charalambous (1973) präsentierte Methode kombiniert. Diese Methoden sind sehr effizient und ihre Effizienz ist mit Hilfe von Standard-Testfunktionen gezeigt.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Biggs, M. C.: Minimization algorithms making use of non-quadratic properties of the objective function. J. Inst. Math. Applics.8, 315–327 (1971).
Charalambous C.: Unconstrained optimization based on homogeneous models. Math. Programming5, 189–198 (1973).
Davidon W. C.: Optimally conditioned optimization algorithms without line searches. Math. Programming9, 1–30 (1975).
Dixon, L. C. W.: Nonlinear optimization: A survey of the state of the art. In: Software for numerical mathematics (Evans, D. J., ed.). London: Academic Press 1974.
Huang, H. Y.: Method of dual matrices for function minimization. Rice University, Dept. of Mechanical and Aerospace Engn. and Materials Sci., Rept. No. AAR-88 (1972).
Jacobson, D. H., Oksman, W.: An algorithm that minimizes homogeneous functions ofN variables inN+2 iterations and rapidly minimizes general functions. J. of Math. Anal. Applics.38, 535–552 (1972).
Kowalik, J. S., Ramakrishnan, K. G.: A numerically stable optimization method based on a homogeneous function. Math. Programming11, 50–66 (1976).
Lukšan, L.: SPONA: Software package for optimization and nonlinear approximation. User's guideversion 2. General Computing Centre, Czechoslovak Academy of Sciences, Rept. No. V-45 (1979). (In Czech.)
Mei, H. H. W.: On the conditioning of DFP and BFGS updates for unconstrained optimization, Dept. of Computer Sci., Cornell University. Technical report No. TR 75-265 (1975).
Oren, S. S., Luenberger, D. G.: Self scaling variable metric (SSVM) algorithms. Part 1: Criteria and Sufficient Condition for scaling a class of algorithms. Management Sci.20, 845–862 (1974).
Oren, S. S., Spedicato, E.: Optimal conditioning of self scaling variable metric algorithms. Math. Programming10, 70–90 (1976).
Shanno, D. F., Phua, K. H.: Matrix conditioning and nonlinear optimization. Math. Programming14, 149–160 (1978).
Stewart, G. W.: A modification of Davidon's minimization method to accept difference approximation to derivatives. J. of the ACM14, 72–83 (1967).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lukšan, L. New combined method for unconstrained minimization. Computing 28, 155–169 (1982). https://doi.org/10.1007/BF02241820
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02241820