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

From MaRDI portal

Revision as of 04:27, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5670145

Jump to:navigation, search

DOI10.1016/0041-5553(71)90020-6zbMath0255.65030OpenAlexW1970306736MaRDI QIDQ5670145

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)

Related Items (3)

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

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5670145&oldid=30373297"