Solving minimax problems by interval methods (Q2639605)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving minimax problems by interval methods |
scientific article |
Statements
Solving minimax problems by interval methods (English)
0 references
1990
0 references
Interval arithmetic offers various tests (monotonicity test, convexity test, etc.) and methods (Newton's method, bisection, etc.) for solving global optimization problems with prescribed accuracy. The paper shows that these tests can be extended to solve global minimax problems. An algorithm as well as two numerical examples are included.
0 references
Interval arithmetic
0 references
monotonicity test
0 references
convexity test
0 references
Newton's method
0 references
bisection
0 references
global optimization
0 references
global minimax problems
0 references
algorithm
0 references
numerical examples
0 references
0 references
