Abstract
In this paper new global optimization algorithms are proposed for solving problems where the objective function is univariate and has Lipschitzean first derivatives. To solve this problem, smooth auxiliary functions, which are adaptively improved during the course of the search, are constructed. Three new algorithms are introduced: the first used the exact a priori known Lipschitz constant for derivatives; the second, when this constant is unknown, estimates it during the course of the search and finally, the last method uses neither the exact global Lipschitz constant nor its estimate but instead adaptively estimates the local Lipschitz constants in different sectors of the search region during the course of optimization. Convergence conditions of the methods are investigated from a general viewpoint and some numerical results are also given. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. Bedrosian, J. Vlach, Time-domain analysis of networks with internally controlled switches, IEEE Trans. Circuits and Systems CAS-39 (3) (1992) 199–212.
N. Femia, V. Tucci, On the modelling of PWM converters for large signal analysis in discontinuous conduction mode, IEEE Trans. On Power Electronics 9 (5) (1994) 487–496.
S.A. Pijavskii, An algorithm for finding the absolute extremum of a function, USSR Comput. Math. Physics 12 (1972) 57–67.
J. Pinter, Extended univariate algorithms for n-dimensional global optimization, Computing 36 (1985) 91–103.
F. Archetti, F. Schoen, A survey on the global optimization problems: General theory and computational approaches, Ann. Oper. Res. 1 (1984) 87–110.
L.C.W. Dixon, G.P. Szegö, Towards global optimization 2, North-Holland, Amsterdam, 1978.
R. Horst, H. Tuy, Global Optimization — Deterministic Approaches, 2nd ed., Springer, Berlin, 1993.
P.M. Pardalos, J.B. Rosen (Eds.), Computational Methods in Global Optimization, Ann. Oper. Res., 25 1990.
H. Ratschek, J. Rokne, New Computer Methods for Global Optimization, Ellis Horwood, Chichester, UK, 1988.
A.H.G. Rinnooy Kan, G.H. Timmer, Global optimization, in: G.L. Nemhauser, A.H.G. Rinnooy Kan, M.J. Todd (Eds.), Optimization, North-Holland, Amsterdam, 1989.
R.G. Strongin, Numerical Methods on Multiextremal Problems, Nauka, Moscow, 1978 (in Russian).
A. Törn, A. Zilinskas, Global Optimization, Lecture Notes in Computer Science 350, Springer, 1989.
A.A. Zhigljavsky, Theory of Global Random Search, Kluwer Academic Publishers, Dordrecht, 1991.
L. Breiman, A. Cutler, A deterministic algorithm for global optimization, Math. Programming 58 (1993) 179–199.
W. Baritompa, Accelerations for a variety of global optimization methods, J. Global Optim. 4 (1) (1994) 37–45.
V.P. Gergel. A global search algorithm using derivatives, in: Neymark, Yu.I. (Ed.), Systems Dynamics and Optimization, N. Novgorod University Press, N.Novgorod, 1992, pp. 161–178 (in Russian).
Yu.G. Evtushenko, Numerical methods for finding global extrema of a nonuniform mesh, USSR Comput. Math. Physics 11 (1971) 1390–1403.
E.A. Galperin, The cubic algorithm, J. Math. Anal. Appl. 112 (2) (1985) 635–640.
P. Hansen, B. Jaumard, S.- H, Lu, Global optimization of univariate Lipschitz functions: 1–2, Math. Programming 55 (1992) 251–293.
E.A. Galperin, The alpha algorithm and the application of the cubic algorithm in case of unknown Lipschitz constant, Comput. Math. Appl. 25 (11/12) (1993) 71–78.
Ya.D. Sergeyev, “Divide the best” global optimization algorithms, Report n. 2/94, University of Calabria, Department of Mathematics, Rende-Cosenza, Italy, 1994.
J. Pinter, Convergence qualification of adaptive partition algorithms in global optimization, Math. Programming 56 (1992) 343–360.
V.A. Grishagin, On Convergence Conditions for a Class of Global Search Algorithms, Kharkov, 1979, pp. 82–84 (in Russian).
V.A. Grishagin, Investigation of a Class of Numerical Methods for Solving Multiextremal Problems, Ph.D. Thesis, Gorky State University, Gorky, 1983 (in Russian).
Ya. D. Sergeyev, A method using local tuning for minimizing function with Lipschitz derivatives, I. M. Bomze et al. (eds.), Developments in Global Optimization (1997) 199–215.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sergeyev, Y.D. Global one-dimensional optimization using smooth auxiliary functions. Mathematical Programming 81, 127–146 (1998). https://doi.org/10.1007/BF01584848
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01584848