EQUILIBRIUM ALGORITHMS WITH NONMONOTONE LINE SEARCH TECHNIQUE FOR SOLVING THE TRAFFIC ASSIGNMENT PROBLEMS

作     者：ZHAO Hui GAO Ziyou ZHAO Hui GAO Ziyou (School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China.

作者机构：School of Traffic and Transportation Beijing Jiaotong University Beijing 100044 China. 

出 版 物：《Journal of Systems Science & Complexity》 (系统科学与复杂性学报（英文版）)

年 卷 期：2005年第18卷第4期

页      面：543-555页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：This research is partly supported by National Outstanding Young Investigator Grant(70225005) of National Natural Science Foundation of China and the Project(70471088) of National Natural Science Foundation of China 

主　　题：Traffic convex combination algorithm nonmonotone line search global convergence. 

摘      要：This paper presents a unified bination algorithms （such as FrankWolfe problems. Global convergence results are framework of the nonmonotone convex comAlgorithm） for solving the traffic assignment established under mild conditions. The line search procedure used in our algorithm includes the nonmonotone Armijo rule, the non- monotone Goldstein rule and the nonmonotone Wolfe rule as special cases. So, the new algorithm can be viewed as a generalization of the regular convex combination algorithm.