Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions (Q1102868): Difference between revisions

A domain partitioning algorithm for minimizing or maximizing a Lipschitz continuous function is enhanced to yield two new, more efficient algorithms. The use of interval arithmetic in the case of rational functions and the estimates of Lipschitz constants valid in subsets of the domain in the case of others, and the addition of local optimization has resulted in an algorithm which, in tests on standard functions, performs well.