A primal-dual interior point method whose running time depends only on the constraint matrix

Probabilistic analysis of condition numbers for linear programming

Journal of Optimization Theory and Applications

Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time

Journal of the ACM (JACM)

A New Complexity Result on Solving the Markov Decision Problem

Mathematics of Operations Research

On the probabilistic complexity of finding an approximate solution for linear programming

Journal of Complexity

Further development of multiple centrality correctors for interior point methods

Computational Optimization and Applications

Optimization and NP_R-completeness of certain fewnomials

Proceedings of the 2009 conference on Symbolic numeric computation

Convex optimization

Algorithms and theory of computation handbook

Proximity of Weighted and Layered Least Squares Solutions

SIAM Journal on Matrix Analysis and Applications

The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate

Mathematics of Operations Research

On the condition numbers for polyhedra in Karmarkar's form

Operations Research Letters