event
Simple methods for extremely large-scale convex problems
Primary tabs
In Optimization, convex programs form a "solvable case" { under mild computability assumptions, a global minimum of a convex objective f(x) over a convex and bounded feasible set X
Status
-
Workflow Status:
Published -
Created By:
Barbara Christopher -
Created:
10/08/2010 -
Modified By:
Fletcher Moore -
Modified:
10/07/2016
Categories
Keywords
-
No keywords were submitted.
Target Audience
-
No target audience selected.