Computational Mathematics and Mathematical Physics · 2007 · 13 citations · 0 references
Natural SciencesComputer ScienceAlgorithmsOptimizationBranch And BoundCombinatorial OptimizationConvex OptimizationGlobal OptimizationOptimization TheoryBranch-and-cutCut AlgorithmsGlobal Search Algorithms
A class of functions that attain their minima on a compact subset of the n-dimensional Euclidean space E n is introduced. This is a rather broad functional class, which is stable with respect to operations commonly occurring in optimization. The functions in this class are a convenient tool in the formal description of numerous applied problems. Moreover, reasonably efficient methods can be developed for finding global minima of such functions on a compact set. One such method is discussed in this paper.