Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model
Consider the supposedly simple problem of computing a point in a convex set that is conveyed by a separation oracle with no further information (e.g., no domain ball containing or intersecting the set, etc.). The authors' interest in this problem stems from fundamental issues involving the inte...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Institute for Operations Research and the Management Sciences (INFORMS),
2010-06-22T20:53:42Z.
|
| Subjects: | |
| Online Access: | Get fulltext |