The complexity of the computation of a global minimum in certain classes of optimization problems

From MaRDI portal

Publication:1124665

Jump to:navigation, search

zbMath0817.65047MaRDI QIDQ1124665

V. N. Nefedov

Publication date: 17 May 1995

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

complexity global optimization global minimum non-uniform mesh Lipschitz function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

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

This page was built for publication: The complexity of the computation of a global minimum in certain classes of optimization problems

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