The complexity of the computation of a global minimum in certain classes of optimization problems (Q1124665)
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: The complexity of the computation of a global minimum in certain classes of optimization problems |
scientific article; zbMATH DE number 746433
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of the computation of a global minimum in certain classes of optimization problems |
scientific article; zbMATH DE number 746433 |
Statements
The complexity of the computation of a global minimum in certain classes of optimization problems (English)
0 references
17 May 1995
0 references
global optimization
0 references
global minimum
0 references
Lipschitz function
0 references
non-uniform mesh
0 references
complexity
0 references
0.8035374283790588
0 references
0.7961883544921875
0 references
0.7821804881095886
0 references
0.7780610918998718
0 references
