Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:field |
gptkb:mathematical_optimization
convex optimization |
| gptkbp:namedAfter |
gptkb:Arkadi_Nemirovski
David Yudin |
| gptkbp:publishedIn |
gptkb:Mathematics_of_Operations_Research
|
| gptkbp:relatedTo |
convex set
ellipsoid method separation oracle |
| gptkbp:significance |
established polynomial-time solvability of convex programming with a separation oracle
|
| gptkbp:state |
ellipsoid method can solve convex optimization problems with a polynomial number of oracle calls
|
| gptkbp:yearProposed |
1976
|
| gptkbp:bfsParent |
gptkb:Michael_Yudin
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
Yudin-Nemirovski theorem
|