On a sequential search strategy in global optimization problems

DOI10.1007/BF02575808zbMath0506.90074OpenAlexW2051895035MaRDI QIDQ1837114

Fabio Schoen

Publication date: 1982

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02575808

zbMATH Keywords

global optimizationcomputational experimentsglobal maximumLipschitz conditionssequential search strategyEvtushenko's algorithmone-dimensional optimizationbest- optimal strategycomparison of algorithmoptimal choice of sequential stepSchubert's algorithmsequential strategies

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (5)

On Timonov's algorithm for global optimization of univariate Lipschitz functions ⋮ A global minimization algorithm for Lipschitz functions ⋮ Convergence qualification of adaptive partition algorithms in global optimization ⋮ Global optimization of univariate Lipschitz functions. I: Survey and properties ⋮ Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: On a sequential search strategy in global optimization problems