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. (Author/TRRL)

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/issn/01912615
• Corporate Authors:

  Pergamon Press, Incorporated

  Headington Hill Hall
  Oxford OX30BW,    
• Authors:
  • Weintraub, A
  • Ortiz, C
  • Gonzalez, J
• Publication Date: 1985-4

Media Info

• Features: Figures; References; Tables;
• Pagination: p. 113-122
• Serial:
  • Transportation Research Part B: Methodological
  • Volume: 19
  • Issue Number: 2
  • Publisher: Elsevier
  • ISSN: 0191-2615
  • Serial URL: http://www.sciencedirect.com/science/journal/01912615

Subject/Index Terms

• TRT Terms: Acceleration (Mechanics); Algorithms; Economic efficiency; Mathematical models; Methodology; Optimization; Traffic assignment
• Uncontrolled Terms: Efficiency; Modifications; Optimum
• ITRD Terms: 5911: Efficiency; 6473: Mathematical model; 9102: Method; 9048: Modification; 679: Traffic assignment
• Subject Areas: Economics; Highways; Operations and Traffic Management;

Filing Info

• Accession Number: 00451398
• Record Type: Publication
• Source Agency: Transport Research Laboratory
• Files: ITRD, TRIS
• Created Date: May 31 1986 12:00AM