论文信息 - Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs

Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs

We discuss methods for speeding up convergence of the Frank-Wolfe algorithm for solving nonlinear convex programs. Models involving hydraulic networks, road networks and factory-warehouse networks are described. The PARTAN technique and heuristic variations of the Frank-Wolfe algorithm are described which serve to significantly improve the convergence rate with no significant increase in memory requirements. Computational results for large-scale models are reported.

[1] W. Zangwill. Nonlinear programming : a unified approach , 1972 .

[2] Jeffery L. Kennington,et al. Solving the Pipe Network Analysis Problem Using Optimization Techniques , 1978 .

[3] J. G. Klincewicz,et al. A scaled reduced gradient algorithm for network flow problems with convex separable costs , 1981 .

[4] R. V. Helgason,et al. Algorithms for network programming , 1980 .

[5] G. Meyer. Accelerated Frank–Wolfe Algorithms , 1974 .

[6] E. Polak. Introduction to linear and nonlinear programming , 1973 .

[7] Philip Wolfe,et al. An algorithm for quadratic programming , 1956 .

[8] Larry J. LeBlanc,et al. AN EFFICIENT APPROACH TO SOLVING THE ROAD NETWORK EQUILIBRIUM TRAFFIC ASSIGNMENT PROBLEM. IN: THE AUTOMOBILE , 1975 .

[9] Mario Gerla,et al. Optimal Routing in a Packet-Switched Computer Network , 1974, IEEE Transactions on Computers.

[10] Charles A. Holloway. An extension of the frank and Wolfe method of feasible directions , 1974, Math. Program..

[11] C. B. Mcguire,et al. Studies in the Economics of Transportation , 1958 .