The complexity of optimizing over a simplex, hypercube or sphere: a short survey (Q940826): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10100-007-0052-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2114467398 / rank | |||
Normal rank | |||
Revision as of 18:06, 19 March 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
