The complexity of optimizing over a simplex, hypercube or sphere: a short survey (Q940826): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:05, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of optimizing over a simplex, hypercube or sphere: a short survey |
scientific article |
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
