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

DOI10.1016/0041-5553(90)90073-2MaRDI QIDQ3354476zbMATH OpenOpenAlexFDO

Authors A. 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) Nonlinear programming (90C30) Abstract computational complexity for mathematical programming problems (90C60)

Cited in

(3)

• Certified multifidelity zeroth-order optimization
• Optimal algorithms for global optimization in case of unknown Lipschitz constant
• Condition number based complexity estimate for computing local extrema

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3354476)