Optimization Online


On the Primal-Dual Geometry of Level Sets in Linear and Conic Optimization

Robert M. Freund (rfreund***at***mit.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/2001
Entry Accepted: 08/10/2001
Entry Last Modified: 08/09/2001

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society