On the Number of Iterations of Piyavskii's Global Optimization Algorithm

DOI10.1287/moor.16.2.334zbMath0742.90069OpenAlexW2122617146MaRDI QIDQ3978619

No author found.

Publication date: 25 June 1992

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.16.2.334

zbMATH Keywords

global optimizationLipschitz functionPiyavskij's algorithm\(\varepsilon\)-optimal value

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (9)

Global optimization of Hölder functions ⋮ OPTIMAL ADAPTIVE ALGORITHMS FOR FINDING THE NEAREST AND FARTHEST POINT ON A PARAMETRIC BLACK-BOX CURVE ⋮ Global optimization of univariate Lipschitz functions. I: Survey and properties ⋮ Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison ⋮ MSO: a framework for bound-constrained black-box global optimization algorithms ⋮ Optimally adaptive integration of univariate Lipschitz functions ⋮ A naive multi-scale search algorithm for global optimization problems ⋮ Derivative-free optimization methods ⋮ On using estimates of Lipschitz constants in global optimization

This page was built for publication: On the Number of Iterations of Piyavskii's Global Optimization Algorithm