The complexity of the computation of the global extremum in a class of multi-extremum problems

DOI10.1016/0041-5553(90)90073-2zbMath0729.90076OpenAlexW2071986624MaRDI QIDQ3354476

A. G. Perevozchikov

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0041-5553(90)90073-2

zbMATH Keywords

branch and boundlower and upper boundssuccessive search algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30)

Related Items (1)

Optimal algorithms for global optimization in case of unknown Lipschitz constant

This page was built for publication: The complexity of the computation of the global extremum in a class of multi-extremum problems