Publication Date



Technical Report: UTEP-CS-03-28a

Published in Journal of Global Optimization, 2005, Vol. 33, No. 4, pp. 617-624.


It is known that there are feasible algorithms for minimizing convex functions, and that for general functions, global minimization is a difficult (NP-hard) problem. It is reasonable to ask whether there exists a class of functions that is larger than the class of all convex functions for which we can still solve the corresponding minimization problems feasibly. In this paper, we prove, in essence, that no such more general class exists. In other words, we prove that global optimization is always feasible only for convex objective functions.

tr03-28.pdf (144 kB)
Original file: UTEP-CS-03-28