An Implementation of a Lipschitzian Global Optimization Procedure
The general framework and underlying convergence theory of adaptive partition algorithms in global optimization leave ample room for constructing robust and effective, computationally viable algorithm-instances. The program system described below has been implemented (in gradually developed versions), extensively tested, and applied by this author in the past decade. This, of course, does not imply any notion of ‘perfection’—in fact, the program modules have often been (and surely will be) modified and improved, not infrequently in connection with new applications.
Unable to display preview. Download preview PDF.