Loading edition detail...
Preparing this view.
Robert Michael Freund
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 | Alfred P. Sloan School of Management, Massachusetts Institute of Technology |
|---|---|
| Pages | 12 |
| Search language | english |
Publication-specific alternatives linked to the same work.