The Stiff Is Moving—Conjugate Direction Frank-Wolfe Methods with Applications to Traffic Assignment*

摘要

We present versions of the Frank-Wolfe method for linearly constrained convex programs, in which consecutive search directions are made conjugate. Preliminary computational studies in a MATLAB environment applying pure Frank-Wolfe, conjugate direction Frank-Wolfe (CFW), bi-conjugate Frank-Wolfe (BFW), and "par-tanized" Frank-Wolfe methods to some classical Traffic Assignment Problems show that CFW and BFW compare favorably to the other methods. This spurred a more detailed study, comparing our methods to an origin-based algorithm. This study indicates that our methods are competitive for accuracy requirements ensuring link flow stability. We also show that CFW is globally convergent. We further point at independent studies by other researchers that show that our methods compare favorably with recent bush-based and gradient projection algorithms on computers with several cores.