Abstract
We consider the following global optimization problems for a univariate Lipschitz functionf defined on an interval [a, b]: Problem P: find a globally optimal value off and a corresponding point; Problem P′: find a globallyε-optimal value off and a corresponding point; Problem Q: localize all globally optimal points; Problem Q′: find a set of disjoint subintervals of small length whose union contains all globally optimal points; Problem Q″: find a set of disjoint subintervals containing only points with a globallyε-optimal value and whose union contains all globally optimal points.
We present necessary conditions onf for finite convergence in Problem P and Problem Q, recall the concepts necessary for a worst-case and an empirical study of algorithms (i.e., those ofpassive and ofbest possible algorithms), summarize and discuss algorithms of Evtushenko, Piyavskii-Shubert, Timonov, Schoen, Galperin, Shen and Zhu, presenting them in a simplified and uniform way, in a high-level computer language. We address in particular the problems of using an approximation for the Lipschitz constant, reducing as much as possible the expected length of the region of indeterminacy which contains all globally optimal points and avoiding remaining subintervals without points with a globallyε-optimal value. New algorithms for Problems P′ and Q″ and an extensive computational comparison of algorithms are presented in a companion paper.
Similar content being viewed by others
References
M.D. Atkinson, J.-R. Sack, N. Santoro and Th. Strotholte, “Min-max heaps and generalized priority queues,”Communications of the ACM 29 (1986) 996–1000.
F. Archetti and B. Betrò, “A priori analysis of deterministic strategies for global optimization problems,” in: L.C.W. Dixon and G.P. Szegö, eds.,Towards Global Optimization 2 (North-Holland, Amsterdam, 1978).
P. Basso, “Iterative methods for the localization of the global maximum,”SIAM Journal of Numerical Analysis 19 (1982) 781–792.
R.P. Brent,Algorithms for Minimization without Derivatives (Prentice-Hall, Englewood Cliffs, NJ, 1973).
S.H. Brooks, “Discussion of random methods for locating surface maxima,”Operations Research 6 (1958) 244–251.
Y.M. Danilin, “Estimation of the efficiency of an absolute-minimum-finding algorithm,”U.S.S.R. Computational Mathematics and Mathematical Physics 11 (1971) 261–267.
Y.G. Evtushenko, “Numerical methods for finding global extrema (case of a non-uniform mesh),”U.S.S.R. Computational Mathematics and Mathematical Physics 11 (1971) 38–54.
E.A. Galperin, “The cubic algorithm,”Journal of Mathematical Analysis and Applications 112 (1985) 635–640.
E.A. Galperin, “Precision, complexity, and computational schemes of the cubic algorithm,”Journal of Optimization Theory and Applications 57 (1988) 223–238.
E.A. Galperin, “The beta-algorithm,”Journal of Mathematical Analysis and Applications 126 (1987) 455–468.
A. Hasham and J.-R. Sack, “Bounds for min-max heaps,”BIT 27 (1987) 315–323.
P. Hansen, B. Jaumard and S.H. Lu, “Global minimization of univariate functions by sequential polynomial approximation,”International Journal of Computer Mathematics 28 (1989) 183–193.
P. Hansen, B. Jaumard and S.H. Lu, “On the number of iterations of Piyavskii's global optimization algorithm,”Mathematics of Operations Research 16 (1991) 334–350.
P. Hansen, B. Jaumard and S.H. Lu, “On the use of estimates of the Lipschitz constant in global optimization,” to appear in:Journal of Optimization Theory and Applications.
P. Hansen, B. Jaumard and S.H. Lu, “On Timonov's algorithm for global optimization of univariate Lipschitz functions,”Journal of Global Optimization 1 (1991) 37–46.
P. Hansen, B. Jaumard and S.H. Lu, “Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison,”Mathematical Programming 55 (1992) 273–292, this issue.
P. Hansen and A. de Palma, “Optimal departure times for commuters in congested networks,”Annals of Operations Research 25 (1990) 279–290.
P. Hanjoul, P. Hansen, D. Peeters and J.-F. Thisse, “Uncapacited plant location under alternative space price policies,”Management Science 36 (1990) 41–57.
R. Horst, “A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization,”Journal of Optimization Theory and Applications 51 (1986) 271–291.
R. Horst and H. Tuy, “On the convergence of global methods in multi-extremal optimization,”Journal of Optimization Theory and Applications 54 (1987) 253–271.
V.V. Ivanov, “On optimal algorithms of minimization in the class of functions with the Lipschitz condition,”Information Processing 71 (1972) 1324–1327.
D.Q. Mayne and E. Polak, “Outer approximation algorithm for nondifferentiable optimization problems,”Journal of Optimization Theory and Applications 42 (1984) 19–30.
C.C. Meewella and D.Q. Mayne, “An algorithm for global optimization of Lipschitz functions,”Journal of Optimization Theory and Applications 57 (1988) 307–323.
R. H. Mladineo, “An algorithm for finding the global maximum of a multimodal multivariate function,”Mathematical Programming 34 (1986) 188–200.
V.N. Nefedov, “Search for the global maximum of a function of several variables on a set defined by constraints of inequality type,”U.S.S.R. Computational Mathematics and Mathematical Physics 27 (1987) 23–32.
A.A. Patwardhan, M.N. Karim and R. Shah, “Controller tuning by a least-squares method,”AIChE Journal 33 (1987) 1735–1737.
J. Pinter, “Globally convergent methods forn-dimensional multi-extremal optimization,”Optimization 17 (1986) 187–202.
J. Pinter, “Extended univariate algorithms forn-dimensional global optimization,”Computing 36 (1986) 91–103.
J. Pinter, “Global optimization on convex sets,”OR Spektrum 8 (1986) 197–202.
J. Pinter, “Branch-and-bound algorithm for solving global optimization problems with Lipschitzian structure,”Optimization 19 (1988) 101–110.
S.A. Piyavskii, “An algorithm for finding the absolute minimum of a function,”Theory of Optimal Solutions, Vol. 2 (IK AN, Kiev, 1967) pp. 13–24. [In Russian.]
S.A. Piyavskii, “An algorithm for finding the absolute extremum of a function,”U.S.S.R. Computational Mathematics and Mathematical Physics 12 (1972) pp. 57–67. [Žurnal Vyčislitel'noi Matematiki i Matematičeskoi 12 (1972) 888–896.]
P.A.S. Ralston, K.R. Watson, A.A. Patwardhan and P.B. Deshpande, “A computer algorithm for optimized control,”Industrial and Engineering Chemistry, Product Research and Development 24 (1985) 1132.
F. Schoen, “On a sequential search strategy in global optimization problems,”Calcolo 19 (1982) 321–334.
Z. Shen and Y. Zhu, “An interval version of Shubert's iterative method for the localization of the global maximum,”Computing 38 (1987) 275–280.
M.A. Shepilov, “Determination of the roots and of the global extremum of a Lipschitz function,”Cybernetics 23 (1987) 233–238.
B.O. Shubert, “A sequential method seeking the global maximum of a function,”SIAM Journal on Numerical Analysis 9 (1972) 379–388.
O.I. Strigul, “Search for a global extremum in a certain subclass of functions with the Lipschitz condition,”Cybernetics 21 (1985) 193–195.
R.G. Strongin, “On the convergence of an algorithm for finding a global extremum,”Engineering Cybernetics 11 (1973) 549–555.
A.G. Sukharev, “Best sequential search strategies for finding an extremum,” Žurnal Vyčislitel'noi Matematiki i Matematičeskoi 12 (1971) 35–50. [English translation:U.S.S.R. Computational Mathematics and Mathematical Physics 12 (1972) 39–59].
L.N. Timonov, “An algorithm for search of a global extremum,”Engineering Cybernetics 15 (1977) 38–44.
Author information
Authors and Affiliations
Additional information
The research of the authors has been supported by AFOSR grants 0271 and 0066 to Rutgers University. Research of the second author has been also supported by NSERC grant GP0036426 and FCAR grant 89EQ4144. We thank N. Paradis for drawing some of the figures.
Rights and permissions
About this article
Cite this article
Hansen, P., Jaumard, B. & Lu, SH. Global optimization of univariate Lipschitz functions: I. Survey and properties. Mathematical Programming 55, 251–272 (1992). https://doi.org/10.1007/BF01581202
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01581202