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

MaRDI QIDQ1124665zbMATH OpenFDO

Authors V. N. Nefedov

Publication date 17 May 1995

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

zbMATH Keywords

global optimizationcomplexityglobal minimumLipschitz functionnon-uniform mesh

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4156224
• Estimating the information complexity of global optimization and the global solution of equations
• Global optimization under Lipschitzian constraints
• An algorithm for global optimization of Lipschitz continuous functions
• On using estimates of Lipschitz constants in global optimization

Cited in

(8)

• Estimating the characteristics of the accuracy and computational complexity in approximate methods of global optimization of nonlinear functionals
• Global optimization: On pathlengths in min-max graphs
• Bounds on characteristics of algorithms to find the global minimum of a function in an \(n\)-dimensional parallelepiped with prespecified accuracy
• Estimating the information complexity of global optimization and the global solution of equations
• scientific article; zbMATH DE number 4156224 (Why is no real title available?)
• Complexity of general continuous minimization problems: a survey
• Area-time complexity of the unconstrained minimization problem
• On complexity of a global optimization problem

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

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