Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions (Q1102868): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q463878 |
Changed an Item |
||
| Property / author | |||
| Property / author: David Q. Mayne / rank | |||
Normal rank | |||
Revision as of 10:10, 15 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions |
scientific article |
Statements
Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions (English)
0 references
1989
0 references
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.
0 references
domain partitioning algorithm
0 references
Lipschitz continuous function
0 references
global optimization
0 references
nondifferentiable optimization
0 references
rational functions
0 references
