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

DOI10.1007/BF02366507zbMATH Open0886.65060MaRDI QIDQ1364062FDOQ1364062

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The complexity of the computation of a global minimum in certain classes of optimization problems
• Title not available (Why is that?)
• Title not available (Why is that?)

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)