Beyond convex? global optimization is feasible only for convex objective functions: a theorem (Q816060)
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 5007666
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Beyond convex? global optimization is feasible only for convex objective functions: a theorem |
scientific article; zbMATH DE number 5007666 |
Statements
Beyond convex? global optimization is feasible only for convex objective functions: a theorem (English)
0 references
20 February 2006
0 references
Computational complexity
0 references
Global optimization
0 references
Non-convexity
0 references
0.7849323749542236
0 references
0.7701554298400879
0 references
0.7615293860435486
0 references
0.7569916844367981
0 references
0.7511036992073059
0 references
