- On the Primal-Dual Geometry of Level Sets in Linear and Conic Optimization Robert M. Freund (rfreundmit.edu) Abstract: For a conic optimization problem: minimize cx 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, level sets, geometry Category 1: Linear, Cone and Semidefinite Programming Category 2: Convex and Nonsmooth Optimization (Convex Optimization ) Citation: MIT Operations Research Center Working Paper Download: [Postscript]Entry Submitted: 08/09/2001Entry Accepted: 08/10/2001Entry Last Modified: 08/09/2001Modify/Update this entry Visitors Authors More about us Links Subscribe, Unsubscribe Digest Archive Search, Browse the Repository Submit Update Policies Coordinator's Board Classification Scheme Credits Give us feedback Optimization Journals, Sites, Societies Optimization Online is supported by the Mathematical Programming Society and by the Optimization Technology Center.