Estimation of the efficiency of an absolute-minimum-finding algorithm

DOI10.1016/0041-5553(71)90020-6MaRDI QIDQ5670145zbMATH OpenOpenAlexFDO

Authors Yu. M. Danilin

Publication date 1973

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(71)90020-6

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Cited in

(4)

• Convergence qualification of adaptive partition algorithms in global optimization
• Global optimization of univariate Lipschitz functions. I: Survey and properties
• OPTIMAL ADAPTIVE ALGORITHMS FOR FINDING THE NEAREST AND FARTHEST POINT ON A PARAMETRIC BLACK-BOX CURVE
• Certified multifidelity zeroth-order optimization

This page was built for publication: Estimation of the efficiency of an absolute-minimum-finding algorithm

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