Best sequential search strategies for finding an extremum

DOI10.1016/0041-5553(72)90064-XzbMath0318.65028MaRDI QIDQ4080662

No author found.

Publication date: 1973

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (6)

On the worst-case optimal multi-objective global optimization ⋮ A one-step worst-case optimal algorithm for bi-objective univariate optimization ⋮ On Timonov's algorithm for global optimization of univariate Lipschitz functions ⋮ Algorithms for multi-extremal mathematical programming problems employing the set of joint space-filling curves ⋮ Asymptotic error for the global maximum of functions in s dimensions ⋮ The average a posteriori error of numerical methods

This page was built for publication: Best sequential search strategies for finding an extremum