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

This publication has 4 references indexed in Scilit:

• Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
  SIAM Journal on Optimization, 1999
• Some characterizations and properties of the “distance to ill-posedness” and the condition measure of a conic linear system
  Mathematical Programming, 1999
• Primal-Dual Interior-Point Methods
  Published by Society for Industrial & Applied Mathematics (SIAM) ,1997
• The Relaxation Method for Solving Systems of Linear Inequalities
  Mathematics of Operations Research, 1980