Accelerating convergence of the Frank-Wolfe algorithm

We consider the Frank-Wolfe algorithm in the context of the traffic assignment problem. The slow-convergence characteristics close to the optimum solution of this popular approach are well known. Several proposals have improved on the original method by modifying the search direction. We propose modifying the step size, which leads to very significant improvements in efficiency.