Approximate search for a global minimum in problems of mathematical programming that are close to convex

zbMath0964.90034MaRDI QIDQ5932899

E. S. Sevitin, Vladimir V. Voloshinov

Publication date: 18 June 2001

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

zbMATH Keywords

global minimumnonconvex problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

This page was built for publication: Approximate search for a global minimum in problems of mathematical programming that are close to convex