Projected Newton Methods and Optimization of Multicommodity Flows

1963, respectively. His experience has included teaching courses in electrical engineering at the Polytechnic Institute of Brooklyn, from 1960 to 1963. and has also included various consulting positions. From July 1963 to January 1974 he was with the Mc-Donne11 Douglas Astronautics Co., on a full-time basis. Currently he is Professor and Associate Chairman of Electrical Engineering at the University of Southern California, Los Angeles. He teaches courses in estimation theory and seismic data processing for oil exploration. and is Director of the USC Geo-Signal Processing Program. He has published over 130 technical papers and is author of the monograph Optinzal Seismic Abszruct-A superlinearly convecent Newton like method for linearly constrained optimization problems is adapted for solution of multicommod-ity nehvork flow probIems of the type arising in communication and transportation networks. We shonr that the method can be implemented approximately by making use of conjugate gradient iterations without the need to compute explicitly the Hessian matrix. Preliminary computational results suggest that this type of method is capable of yielding highly accurate solutions of nonlinear multicommodity flow problems far more efficiently than any of the methods available at present.

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

[2]  J. B. Rosen.  The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints , 1960 .

[3]  A. Goldstein.  Convex programming in Hilbert space , 1964 .

[4]  M. Canon,et al.  A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm , 1968 .

[5]  D. Goldfarb.  Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints , 1969 .

[6]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[7]  J. Dunn.  Rates of convergence for conditional gradient algorithms near singular and nonsingular extremals , 1979, 1978 IEEE Conference on Decision and Control including the 17th Symposium on Adaptive Processes.

[8]  Eliezer M. Gafni,et al.  Convergence of a routing algorithm , 1979 .

[9]  Melanie L. Lenard,et al.  A computational study of active set strategies in nonlinear programming with linear constraints , 1979, Math. Program..

[10]  D. Bertsekas.  A class of optimal routing algorithms for communication networks , 1980 .

[11]  Stella Dafermos,et al.  Traffic Equilibrium and Variational Inequalities , 1980 .

[12]  D. Bertsekas.  Projected Newton methods for optimization problems with simple constraints , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[13]  D. Bertsekas,et al.  Projection methods for variational inequalities with application to the traffic assignment problem , 1982 .