New results on verified global optimization (Q2564991)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 962262
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New results on verified global optimization |
scientific article; zbMATH DE number 962262 |
Statements
New results on verified global optimization (English)
0 references
7 January 1997
0 references
The branch and bound principle is used in global optimization to subdivide the starting box and to delete sub-boxes that do not contain any global minimum. This paper compares different versions and strategies of the principle. A theoretical result establishes optimality of a ``best-first'' strategy. A multi-section algorithm for subdivision of boxes is introduced. Numerical results show that this algorithm is usually superior to bisection.
0 references
numerical results
0 references
branch and bound principle
0 references
global optimization
0 references
multi-section algorithm
0 references
subdivision of boxes
0 references
0 references
0.8299654722213745
0 references
0.8216331005096436
0 references
0.8198245167732239
0 references
