Abstract
Following the presentation of a general partition algorithm scheme for seeking the globally best solution in multiextremal optimization problems, necessary and sufficient convergence conditions are formulated, in terms of respectively implied or postulated properties of the partition operator. The convergence results obtained are pertinent to a number of deterministic algorithms in global optimization, permitting their diverse modifications and generalizations.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 343-360 |
| Number of pages | 18 |
| Journal | Mathematical Programming |
| Volume | 56 |
| Issue number | 1-3 |
| DOIs | |
| State | Published - Aug 1992 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Software
- General Mathematics
Keywords
- adaptive partition strategies
- examples
- Multiextremal optimization
- necessary and sufficient convergence conditions