Diagonally Extended Univariate Algorithms for Multidimensional Global Optimization
In Part 2, a general framework was provided for analysing and constructing adaptive partition algorithms Specific instances of the generic partition algorithm scheme (PAS, as introduced in Section 2.1.2) can be applied to solve a broad class of global optimization problems with continuous or Lipschitz-continuous structure. The case of one- and multidimensional intervals and simplices, and more general convex, star and Lipschitzian feasible sets was discussed in detail.
KeywordsSearch Point Global Optimization Problem Implementation Aspect Theoretical Convergence Decomposable Operator
Unable to display preview. Download preview PDF.