Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results (Q1583690): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: C-XSC 2.0 / rank | |||
Normal rank | |||
Revision as of 20:33, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results |
scientific article |
Statements
Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results (English)
0 references
7 November 2002
0 references
A global optimization problem is considered whose objective function \(f(\cdot)\) is defined over an \(n\)-dimensional box, and an inclusion function for \(f(\cdot)\) is known. Several interval branch-and-bound algorithms are proposed. The usual bisection step was substituted by the subdivision of the actual interval into many subintervals. The convergence properties are investigated theoretically as well as the convergence improvements by means of the acceleration tests. The numerical testing results are supposed to the published in a subsequent paper.
0 references
global optimization
0 references
branch-and-bound
0 references
interval arithmetic
0 references
