Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure (Q3789345): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:40, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure |
scientific article |
Statements
Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure (English)
0 references
1988
0 references
global minimum
0 references
Lipschitz continuous functions
0 references
branch-and-bound
0 references
constrained global minimization
0 references
sequentially generated subintervals
0 references
partition selection
0 references
partition refinement
0 references
convergence
0 references
