Computing the distance to infeasibility:
theoretical and practical issues
In recent papers some interesting connections between the distance to
infeasibiliy of a conic linear system and properties of certain
optimization problems have been established.
In this work those ideas are exploited further to give approximation
schemes for the distance to infeasibility. We analyze the theoretical
performance of such schemes and also investigate their behavior in