Traffic;
convex combination algorithm;
nonmonotone line search;
global convergence;
D O I:
暂无
中图分类号:
O229 [搜索理论];
学科分类号:
070105 ;
1201 ;
摘要:
This paper presents a unified framework of the nonmonotone convex combination algorithms (such as Frank-Wolfe Algorithm) for solving the traffic assignment problems. Global convergence results are 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.
机构:
Chiang Mai Univ, Fac Sci, Res Ctr Math & Appl Math, Dept Math, Chiang Mai 50200, Thailand
Chiang Mai Univ, Fac Sci, Data Sci Res Ctr, Dept Math, Chiang Mai 50200, ThailandChiang Mai Univ, Fac Sci, Res Ctr Math & Appl Math, Dept Math, Chiang Mai 50200, Thailand
Suantai, Suthep
Yambangwai, Damrongsak
论文数: 0引用数: 0
h-index: 0
机构:
Univ Phayao, Sch Sci, Phayao 56000, ThailandChiang Mai Univ, Fac Sci, Res Ctr Math & Appl Math, Dept Math, Chiang Mai 50200, Thailand
Yambangwai, Damrongsak
Cholamjiak, Watcharaporn
论文数: 0引用数: 0
h-index: 0
机构:
Univ Phayao, Sch Sci, Phayao 56000, ThailandChiang Mai Univ, Fac Sci, Res Ctr Math & Appl Math, Dept Math, Chiang Mai 50200, Thailand