Bounds on characteristics of algorithms to find the global minimum of a function in an n-dimensional parallelepiped with prespecified accuracy

DOI10.1007/BF02366507MaRDI QIDQ1364062zbMATH OpenFDO

Authors V. A. Lyudvichenko

Publication date 24 August 1997

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

algorithmsglobal minimizationtime boundprespecified accuracy

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3920204 (Why is no real title available?)
• scientific article; zbMATH DE number 4005970 (Why is no real title available?)
• scientific article; zbMATH DE number 3718485 (Why is no real title available?)
• scientific article; zbMATH DE number 44184 (Why is no real title available?)
• scientific article; zbMATH DE number 193848 (Why is no real title available?)
• scientific article; zbMATH DE number 3370185 (Why is no real title available?)
• The complexity of the computation of a global minimum in certain classes of optimization problems

This page was built for publication: Bounds on characteristics of algorithms to find the global minimum of a function in an \(n\)-dimensional parallelepiped with prespecified accuracy

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