The complexity of Philip Wolfe’s method for the minimum Euclidean-norm point problem over a convex polytope has remained unknown since he proposed the method in 1974. We present the first example that Wolfe’s method has exponential behavior under a natural ‘pivot’ rule. Additionally, we improve previous results to show that linear programming reduces in strongly-polynomial time to the minimum n...
