Accelerations for a variety of global optimization methods
Tóm tắt
Optimization methods for a given class are easily modified to utilize additional information and work faster on a more restricted class. In particular algorithms that use only the Lipschitz constant (e.g. Mladineo, Piyavskii, Shubert and Wood) can be modified to use second derivative bounds or gradient calculations. The algorithm of Breiman & Cutler can be modified to use Lipschitz bounds. Test cases illustrating accelerations to various algorithms are provided.
Tài liệu tham khảo
W. Baritompa (1993) Customizing Methods for Global Optimization — a Geometric Viewpoint, J. Global Optimization3, 193–212.
L. Breiman & A. Cutler (1989), A Deterministic Algorithm for Global Optimization,Math. Program., to appear.
R. H. Mladineo (1986), An Algorithm for Finding the Global Maximum of a Multimodal, Multivariate Function,Math. Program. 34 188–200.
S. A. Piyavskii (1972), An Algorithm for Finding the Absolute Extremum of Function,USSR Comp. Math, and Math. Phys. 12, 57–67.
Bruno O. Shubert (1972), A Sequential Method Seeking the Global Maximum of a Function,SIAM J. Numer. Anal. 9, 379–388.
G. R. Wood (1992), The Bisection Method in Higher Dimensions,Math. Program. 55, 319–337.
G. R. Wood (1991), Multidimensional Bisection and Global Optimization,Computers and Math. Applic. 21, 161–172.