The convergence of equilibrium algorithms with non-monotone line search technique

Applied Mathematics and Computation

Volumn 148, Issue 1, 2004, Pages 1-13

  Gao, Ziyou ^a   Lam, W H K ^b   Wong, S C ^c   Yang, H ^d  

^a BEIJING JIAOTONG UNIVERSITY   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^c UNIVERSITY OF HONG KONG   (Hong Kong)

^d HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Convex combination algorithm; Equilibrium assignment; Global convergence; Non monotone line search

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; CONVERGENCE OF NUMERICAL METHODS; FUNCTIONS;

GLOBAL CONVERGENCE;

COMPUTATIONAL METHODS;

EID: 0142211348     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0096-3003(02)00821-4     Document Type: Article

References (17)

1. Bonnans J.F., Panier E.R., Tits A.L. Avoiding the maratos effect by means of a non-monotone line search. II. Inequality constrained problems-feasible iterates. SIAM J. Number. Anal. 29(4):1992;1187-1202.
2. Dembo R.S., Klincevicz J.G. A scaled reduced gradient algorithm for network flow problems with convex separable costs. Math. Program. Stud. 15:1981;125-147.
3. Dafermos S.C., Sparrow F.T. The traffic assignment problem for a general network. J. Res. Nat. Stands Sect. B. 37(2):1969;91-118.
4. M. Florian, An improved linear approximation algorithm or the network equilibrium (packet switching) problem, In: Proceedings of the 1977 IEEE Conference on Decision Control, 1997, pp. 812-818.
5. Fukushima M. A modified Frank-Wolfe algorithm for solving the traffic assignment problem. Trans. Res. B. 18(2):1984;169-177.
6. Gao Z.Y., He G.P., Wu F. Sequential systems of linear equations algorithm for non-linear optimization problems with general constraints. J. Optimiz. Theory Appl. 95(2):1999;371-397.
7. Grippo L., Lampariello F., Lucidi S. A non-monotone line search technique for Newton's method. SIAM J. Number. Anal. 23(4):1986;707-716.
8. LeBlanc L.J., Morlok E.K., Pierskalla W.P. An efficient approach to solving the road networks equilibrium traffic assignment problem. Trans. Res. 9:1975;309-318.
9. L.J. LeBlanc, R.V. Helgason, D.E. Boyce, Improved efficiency of the Frank-Wolfe algorithm. Working paper 18-131, Owen Graduate School of Management, Vanderbilt University, Nashvilla, TN, 1982.
10. Nguyen S. An algorithm for the traffic assignment problem. Trans. Sci. 8:1974;203-216.
11. Panier E.R., Tits A.L. Avoiding the Maratos effect by means of a non-monotone line search. I. General constrained problems. SIAM J. Number. Anal. 28(4):1991;1183-1195.
12. Sheffi Y. Urban Transportation Network: Equilibrium Analysis with Mathematical Programming Methods. 1985;Prentice-Hall, Englewood Cliffs, NJ.
13. US BPR, Traffic Assignment Manual, Washington, DC, 1964.
14. Weintraub A., Ortiz C., Gonzalez J. Accelerating convergence of the Frank-Wolfe algorithm. Trans. Res. B. 19(2):1985;113-122.
15. Weintraub A., Gonzalez J. An algorithm for the traffic assignment problem. Networks. 10:1980;197-209.
16. Wolfe P. Convergence theory in non-linear programming. Abadie J. Integer and Non-linear programming. 1970;1-36 North Holland, Amsterdam.
17. Xu Y.F., Wang W., Gao Z.Y. The algorithm of sequential KKT equations by nonmonotone search for arbitrary initial point. Comput. Optimiz. Appl. 18:2001;221-232.