Bounds on characteristics of algorithms to find the global minimum of a function in an \(n\)-dimensional parallelepiped with prespecified accuracy (Q1364062)
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: Bounds on characteristics of algorithms to find the global minimum of a function in an \(n\)-dimensional parallelepiped with prespecified accuracy |
scientific article; zbMATH DE number 1051101
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounds on characteristics of algorithms to find the global minimum of a function in an \(n\)-dimensional parallelepiped with prespecified accuracy |
scientific article; zbMATH DE number 1051101 |
Statements
Bounds on characteristics of algorithms to find the global minimum of a function in an \(n\)-dimensional parallelepiped with prespecified accuracy (English)
0 references
24 August 1997
0 references
Proposals are offered to construct algorithms for global minimization over an \(n\)-dimensional parallelepiped with prespecified accuracy. A time bound to obtain an ``\(\varepsilon\)-solution'' by such an algorithm is given.
0 references
algorithms
0 references
global minimization
0 references
prespecified accuracy
0 references
time bound
0 references
