On the complexity of optimization over the standard simplex (Q932197)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5299388
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of optimization over the standard simplex |
scientific article; zbMATH DE number 5299388 |
Statements
On the complexity of optimization over the standard simplex (English)
0 references
10 July 2008
0 references
global optimization
0 references
standard simplex
0 references
PTAS
0 references
multivariate Bernstein approximation
0 references
multivariate Lagrange interpolation
0 references
linear programming
0 references
0 references
0 references
0 references
0 references
0.9217639
0 references
0 references
0.90664417
0 references
0.9057643
0 references
0.90085447
0 references
0 references
0.8948334
0 references
0.89387846
0 references
