A new multisection technique in interval methods for global optimization (Q1840763)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new multisection technique in interval methods for global optimization |
scientific article; zbMATH DE number 1563393
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new multisection technique in interval methods for global optimization |
scientific article; zbMATH DE number 1563393 |
Statements
A new multisection technique in interval methods for global optimization (English)
0 references
21 August 2001
0 references
A multisection branch-and-bound technique is proposed for solving a constrained global optimization problem \[ \min_{x\in X}f(x), \] where \(X\) is a rectangle in \(R^n\). Some numerical results are discussed.
0 references
global optimization
0 references
multisection branch and bound method
0 references
numerical results
0 references
