Abstract
This paper is devoted to solving the one-dimensional global optimization problems where the objective function f satisfies a Hölder condition over a real interval [a, b]. We suggest two algorithms as an extended version of the Piyavskii’s method. The first one is based on the use of the tangent at the midpoint of each subinterval of [a, b] of the parabolic lower bounding functions of f. The second one is a combination of two successive phases. In phase 1, we obtain with a few iterations, a subinterval which often contains the point of the global minimum using a \(K_{\alpha }\)-Lipschitz lower bounding functions with a tolerance \(\delta \) much larger than the given accuracy \(\varepsilon \). In phase 2, we apply the first algorithm on the interval obtained in phase 1. A convergence result is proved and compared with the existing methods. The numerical experiments of the two algorithms on some test functions are encouraging.
Similar content being viewed by others
Data Availability
Data sharing not applicable to this article as no datasets were generated or analyzed during the current study.
References
Baritompa, W.P.: Accelirations for a variety of global optimization methods. J. Global Optim. 4(1), 37–45 (1993)
Evtushenko, Yu.G.: Algorithm for finding the global extremum of a function (case of a non-uniforme mesh). USSR Comput. Mathem. Phys. 11(6), 1390–1403 (1971)
Fiorenza, R.: Hölder and locally Hölder Continuous Functions, and Open Sets of Class \(C^{k}C^{k,{\lambda }},\) Springer International Publishing ag (2016)
Gourdin, E., Jaumard, B., Ellaia, R.: Global Optimization of H ölder functions. J. Global Optim. 8, 323–348 (1996)
Hanjoul, P., Hansen, P., Peeters, D., Thisse, J.F.: Uncapacitated plant location under alternative space price policies. Manage. Sci. 36, 41–47 (1990)
Hansen, P., Jaumard, B., Lu, Sh-H.: Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison. Math. Program. 55, 273–292 (1992)
Horst, R., Tuy, H.: Global optimization: Deterministic approach. Springer, Berlin (1993)
Horst, R., Pardalos, P.M.: Handbook of global optimization. Kluwer Academic Publishers, Dordrecht (1995)
Kiatsupaibul, S., Smith, R.L., Zabinsky, Z.B.: Solving infinite horizon optimization problems through analysis of a one-dimensional global optimization problem. J. Global Optim. 66, 711–727 (2016)
Lera, D., Sergeyev, Ya.D.: Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hö lder constants commun non linear Sci Numer Simulat (2014)
Lera, D., Sergeyev, Ya.D.: Global minimization algorithms for H ölder functions. BIT 42(1), 119–133 (2002)
Luenberger, D.G.: Linear and nonlinear programming, 2nd edn. Addition Wesley, Reading Massachusetts (1984)
Pinter, J.D.: Global Optimization in Action, Continuous and Lipschitz Optimization: Algorithm, Implementations and Applications. Book Series of the Nonconvex Optimization and Its Application, Kluwer Academic Publisher, Dordrecht. Springer: New York (1996)
Piyavskii, S.A.: An algorithm for finding the absolute minimum for a function. Theory of Optimal Solution 2, 13–24 (1967)
Rahal, M., Ziadi, A.: A new extension of Piyavskii’s method to H ölder functions of several variables. Appl. Math. Comput. 197, 478–488 (2008)
Rahal, M., Ziadi, A., Ellaia, R.: Generating \({\alpha }\)-dense curves in non-convex sets to solve a class of non-smooth constrained global optimization. Croatian Operational Research Review 289 CRORR 10, 289–314 (2019)
Sergeyev, Ya.D.: An information global optimization algorithm with local tuning. SIAM J. Optim. 5(4), 858–870 (1995)
Sergeyev, Ya.D., Candelieri, A., Kvasov, D.E., Perego, R.: Safe global optimization of expensive noisy black-box functions in the \({\delta } -\) Lipschitz framework, Springer-Verlag GmbH Germany, part of Springer Nature (2020). https://doi.org/10.1007/s00500-020-05030-3
Shubert, B.O.: A sequential method seeking the global maximum of a function. SIAM J. Numer. Anal 9(3), 379–388 (1972)
Strongin, R.G., Sergeyev, Ya.D.: Global optimization with non convex constraints: Sequential and parallel algorithms. Kluwer Academic Publishers, Dordrecht (2000)
Timonov, L.N.: An algorithm for search of a global extremum. Eng. Cybern. 15, 38–44 (1977)
Törn, A., Zilinska, A.: Global Optimization, Springer-Verlag J. Lecture Notes in Computer Sciences. 350 (1989)
Vanderbei, R.J.: Extension of piyavskii’s algorithm to continuous global optimization. J. Global Optim. 14, 205–216 (1999)
Wang, X., Chang, T-SH.: An improved univariate global optimization algorithm with improved linear lower bounding functions. J. Global Optim. 8, 393–411 (1996)
Yahyaoui, A., Ammar, H.: Global optimization of multivariate H ölderian functions using overestimators. Open Access Library Journal 4 (2017)
Zabotin, V.I., Chernyshevsky, P.A.: Extension of Strongin’s global optimization algorithm to a function continuous on a compact interval. Comput. Res. Model. 11(6), 1111–1119 (2019)
Ziadi, A., Guettal, D., Cherruault, Y.: Global Optimization: Alienor mixed method with Piyavskii-Shubert technique. Kybernetes 34(7/8), 1049–1058 (2005)
Funding
This work is funded by the Directorate-General of Scientific Research and Technological Development (DGRSDT) of Algeria.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of Interest
The authors declare no competing interests.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Chenouf, C., Rahal, M. On Hölder global optimization method using piecewise affine bounding functions. Numer Algor 94, 905–935 (2023). https://doi.org/10.1007/s11075-023-01524-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11075-023-01524-x
Keywords
- Global optimization
- Hölder univariate function
- Covering methods
- Affine bounding functions
- Piyavskii’s algorithm