On the convergence of global methods in multiextremal optimization (Q1078082)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the convergence of global methods in multiextremal optimization |
scientific article |
Statements
On the convergence of global methods in multiextremal optimization (English)
0 references
1987
0 references
A general class of derivative-free optimization procedures is presented including the corresponding convergence theory. This theory turns out to be very constructive, in the sense that the convergence conditions not only can be verified easily for many existing algorithms, but also allow to construct new procedures. It is shown that popular methods such as branch-and-bound concepts, Pintér's general class of procedures, the algorithms of Pijavskij, Shubert, and Mladineo, and the approach of Zheng and Galperin cannot only be subsumed under this class of methods, but also partly be improved by regarding them within the framework presented.
0 references
derivative-free optimization procedures
0 references
branch-and-bound
0 references
global optimization
0 references
multiextremal optimization
0 references
Lipschitzian optimization
0 references
0 references