A branch-and-bound algorithm for bound constrained optimization problems without derivatives (Q1904655): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: BRENT / rank | |||
Normal rank | |||
Revision as of 04:20, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm for bound constrained optimization problems without derivatives |
scientific article |
Statements
A branch-and-bound algorithm for bound constrained optimization problems without derivatives (English)
0 references
2 May 1996
0 references
interval arithmetic
0 references
branch-and-bound
0 references
global optimization
0 references
