Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs

This publication has 7 references indexed in Scilit:

• Incorporating Condition Measures into the Complexity Theory of Linear Programming
  SIAM Journal on Optimization, 1995
• Some Remarks on the Foundations of Numerical Analysis
  SIAM Review, 1990
• A Locally Weil-Behaved Potential Function and a Simple Newton-Type Method for Finding the Center of a Polytope
  Published by Springer Nature ,1989
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
  Bulletin of the American Mathematical Society, 1989
• The probability that a numerical analysis problem is difficult
  Mathematics of Computation, 1988
• A polynomial-time algorithm, based on Newton's method, for linear programming
  Mathematical Programming, 1988
• On condition numbers and the distance to the nearest ill-posed problem
  Numerische Mathematik, 1987