Abstract
In this paper we propose a new multi-dimensional methodto solve unconstrained global optimization problems with Lipschitzianfirst derivatives. The method is based on apartition scheme that subdivides the search domain into a set of hypercubesin the course of optimization. This partitioning is regulated by thedecision rule that provides evaluation of the "importance"of each generated hypercube and selection of some partition element to performthe next iteration. Sufficient conditions of global convergence for the newmethod are investigated. Results of numerical experiments are alsopresented.
Similar content being viewed by others
References
Archetti, F. and Shoen, F. (1984), A Survey on the Global Optimization Problems: General Theory and Computational Approaches, Annals of Operation Research 1, 87–110.
Baritompa, W. (1994), Accelerations for a Variety of Global Optimization Methods, J. of Global Optimization 4, 37–45.
Breiman, L. and Cutler, A. (1993), A Deterministic Algorithm for Global Optimization, Math. Programming 58, 179–199.
Butz, A.R. (1968), Space Filling Curves and Mathematical Programming, Information and Control 12, 319–330.
Dixon, L.C.W. and Szegö, G.P., eds. (1978), Towards Global Optimization, 2, North-Holland, Amsterdam.
Evtushenko, Yu.G. (1971), Algorithm for Finding the Global Extremum of a Function (Case of a Nonuniform Mesh), USSR Computational Mathematics and Mathematical Physics 11, 1390–1403.
Evtushenko, Yu.G. and Potapov, M.A. (1994), Deterministic Global Optimization, In: Spedicato E., ed. Algorithms for Continuous Optimization, 481–500, Kluwer, Dordrecht.
Galperin, E.A. (1985), The Cubic Algorithm, J. Math. Analyses and Appl. 112, 635–640.
Gergel, V.P. (1992), A Global Search Algorithm Using Derivatives, In: Neymark Yu. I., ed., Systems Dynamics and Optimization, 161–178, N.Novgorod University Press, N.Novgorod (in Russian).
Gergel, V.P. and Sergeyev, Ya. D. (1994), Sequential and Parallel Global Optimization Algorithms Using Derivatives, University of Calabria, Department of Mathematics, Report n. 7/94.
Grishagin, V.A. (1978), Operational Characteristics for Some Algorithms of Global Search, In: Problems of Random Search, 7, 198–206, Zinatne, Riga (in Russian).
Grishagin, V.A. (1979), On Convergence Conditions for One Class of Global Search Algorithms, In: Numerical Methods on Nonlinear Programming, Proceedings of the All-Union Seminar, 82–84, Kharkov, Russia (in Russian).
Hansen, P., Jaumard B. and Lu, S.-H. (1989), Global Optimization of Univariate Functions by Sequential Polynomial Approximation, Int. J. of Computer Mathematics 28, 183–193
Hansen, P., Jaumard, B. and Lu, S.-H. (1992), Global Optimization of Univariate Lipschitz Functions: 2. New Algorithms and Computational Comparison, Math. Programming 55, 273–292.
Horst, R. and Tuy, H. (1990), Global Optimization–Deterministic Approaches, Springer, Berlin (2nd edn., 1993).
Horst, R. and Pardalos, P.M., eds. (1995), Handbook of Global Optimization, Kluwer, Dordrecht.
Jackson, R.H.F., Boggs, P.T., Nash, S.G. and Powell, S. (1991), Guidelines for Reporting Results of Computational Experiments. Report of the ad hoc committee, Math. Programming 49, 413–425.
Meewella, C.C. and Mayne, D.Q. (1989), Efficient Domain Partitioning Algorithms for Global Optimization of Rational and Lipschitzian Continuous Functions, J. Optim. Theory Appl. 61, 247–270.
Nelder, J.A. and Mead, R. (1964), A Simplex Method for Function Minimization, Computer J. 7, 308–313.
Pardalos, P.M. and Rosen, J.B., eds. (1990), Computational Methods in Global Optimization, Annals of Operations Research 25.
Piyavskii, S.A. (1972), An Algorithm for Finding the Absolute Extremum of a Function, USSR Computational Mathematics and Mathematical Physics 12, 57–67.
Pintér, J. (1986), Extended Univariate Algorithms for N-Dimensional Global Optimization, Computing 36, 91–103.
Pintér, J. (1996), Global Optimization in Action, Kluwer, Dordrecht.
Rinnooy, A.H.G. and Timmer, G.H. (1989), Global Optimization: A Servey, In: Nemhauser G.L. et al., eds., Handbooks of Operations Research 1, 631–662, North-Holland, Elsevier Science Publishers.
Sergeyev, Ya.D. (1995), An One-Dimensional Deterministic Global Minimization Algorithm, Russian J. Computational Mathematics and Mathematical Physics 35, 705–717.
Shubert, B.O. (1972), A Sequential Method Seeking the Global Maximum of a Function, SIAM J. of Numerical Analysis 9, 379–388.
Strongin, R.G. (1978), Numerical Methods for Multiextremal Problems, Nauka, Moskow (inRussian).
Strongin, R.G., Gergel, V.P., Markin, D.L. (1988), Multicriterion Multiextreme Optimization with Nonlinear Constraints, In: Lewandovski, A. and Volkovich, V., eds., Lecture Notes in Economics and Mathematical Systems 351, 120–127. Proceedings 1988. Springer. IIASA, Laxenburg/Austria 1991.
Törn, A.A. and Žilinskas, A. (1989), Global Optimization, Lecture Notes in Computer Sciences, 350, Springer, Berlin.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
GERGEL, V.P. A Global Optimization Algorithm for Multivariate Functions with Lipschitzian First Derivatives. Journal of Global Optimization 10, 257–281 (1997). https://doi.org/10.1023/A:1008290629896
Issue Date:
DOI: https://doi.org/10.1023/A:1008290629896