Beyond convex? global optimization is feasible only for convex objective functions: a theorem
From MaRDI portal
Publication:816060
DOI10.1007/s10898-004-2120-1zbMath1097.90071OpenAlexW2070747462MaRDI QIDQ816060
Ralph Baker Kearfott, Vladik Ya. Kreinovich
Publication date: 20 February 2006
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://digitalcommons.utep.edu/cgi/viewcontent.cgi?article=1406&context=cs_techrep
Abstract computational complexity for mathematical programming problems (90C60) Nonconvex programming, global optimization (90C26)
Related Items (3)
Using expert knowledge in solving the seismic inverse problem ⋮ A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions ⋮ Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
Uses Software
This page was built for publication: Beyond convex? global optimization is feasible only for convex objective functions: a theorem
