The complexity of optimizing over a simplex, hypercube or sphere: a short survey (Q940826)
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 optimizing over a simplex, hypercube or sphere: a short survey |
scientific article; zbMATH DE number 5320576
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of optimizing over a simplex, hypercube or sphere: a short survey |
scientific article; zbMATH DE number 5320576 |
Statements
The complexity of optimizing over a simplex, hypercube or sphere: a short survey (English)
0 references
3 September 2008
0 references
computational complexity
0 references
global optimization
0 references
linear and semidefinite programming
0 references
approximation algorithms
0 references
0 references
0 references
0 references
0 references
0 references
