Loading edition detail...
Preparing this view.
Robert Michael Freund, Sloan School of Management
For a conic optimization problem: minimize c*x subject to Ax=b, x in C, we present a geometric relationship between the maximum norms of the level sets of the primal and the inscribed sizes of the level sets of the dual (or the other way around). Keywords: Convex Optimization, Conic Optimization, Duality, Level Sets.
| Publisher | Creative Media Partners, LLC |
|---|---|
| Search language | english |
| ISBN_13 | 978-1-377-02943-6 primary |
Publication-specific alternatives linked to the same work.