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

Daniel A. Spielman Shang-Hua Teng

Published in: STOC (2001)

Keyphrases

simplex algorithm
primal dual
worst case
computational complexity
linear programming problems
interior point
image processing
reinforcement learning
objective function
multi objective
upper bound
optimization problems
linear programming
randomly generated
network simplex algorithm