(Enter summary)
Abstract: For a conic optimization problem
P : minimize x c
T
x
s.t. Ax = b
x 2 C
and its dual:
D : supremum y;s b
T
y
s.t. A
T
y + s = c
s 2 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).
AMS Subject Classication: 90C, 90C05, 90C60
Keywords: Convex Optimization, Conic Optimization, Duality, Level Sets
1
This research has been partially supported through... (Update)
Context of citations to this paper: More
.... also see the measure g( proposed by Freund [11] and a related geometric approach to primal dual level sets in convex optimization [12]) We also consider the condition measure of Renegar (see [27, 26] In the context of strong infeasibility certi cates, we generalize a...
.... # optimal solution set (which would be infinite in this case) rather than the minimum distance (which would be finite in this case) Also, in [1] in the case of conic optimization with x = 0, it is shown that D # defined using (7) is inversely proportional to the size of the...
Cited by: More
Complexity of Convex Optimization Using Geometry-Based Measures.. - Freund (2002)
(Correct)
Condition and Complexity Measures for Infeasibility.. - Lara, Tunçel (2002)
(Correct)
Similar documents (at the sentence level):
6.3%: On The Primal-Dual Geometry Of Level Sets In Linear - And Conic Optimization
(Correct)
Active bibliography (related documents): More All
0.1: Semidefinite and Lagrangian Relaxations for Hard Combinatorial.. - Wolkowicz (1999)
(Correct)
0.1: Semidefinite Programming and Combinatorial Optimization - Rendl (1998)
(Correct)
0.1: Presolving for Semidefinite Programs Without.. - Gruber, Kruk, Rendl, .. (1998)
(Correct)
Similar documents based on text: More All
0.2: Duality And Self-Duality For Conic Convex Programming - Luo, Sturm, Zhang (1996)
(Correct)
0.2: Condition Number Complexity of an Elementary Algorithm for.. - Epelman, Freund (1997)
(Correct)
0.2: Condition Number Complexity of an Elementary Algorithm for.. - Epelman, Freund (1997)
(Correct)
Related documents from co-citation: More All
2: Some Perturbation Theory for Linear Programming
- Renegar - 1994
2: Linear Algebra and its Applications (context) - Arnoldi's, computing et al. - 1980
2: Local structure of feasible sets in nonlinear programming, part II: Nondegenerac.. (context) - Robinson - 1984
BibTeX entry: (Update)
R. M. Freund, On the primal-dual geometry of level sets in linear and conic optimization, July 2001. http://citeseer.ist.psu.edu/freund01primaldual.html More
@techreport{ freund01primaldual,
author = "R. M. Freund",
title = "On the Primal-Dual Geometry of Level Sets in Linear and Conic Optimization",
address = "Cambridge, MA",
year = "2001",
url = "citeseer.ist.psu.edu/freund01primaldual.html" }
Citations (may not include all citations):
326
Interior-Point Polynomial Algorithms in Convex Programming (context) - Nesterov, Nemirovskii - 1994
17
Condition-based complexity of convex optimization in conic l..
- Freund, Vera - 1999
16
Some characterizations and properties of the \distance to il..
- Freund, Vera - 1999
7
Duality and asymptotic solvability over cones (context) - Ben-Israel, Charnes et al. - 1969
1
Innite programs (context) - Dun - 1956
Documents on the same site (http://web.mit.edu/rfreund/www/publications.html): More
Interior Point Methods: Current Status And Future Directions - Freund, Mizuno (1997)
(Correct)
Condition Number Complexity of an Elementary Algorithm for.. - Epelman, Freund (1997)
(Correct)
Condition-Based Complexity Of Convex Optimization In Conic.. - Freund, Vera (1998)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC