摘要
这篇论文论述一个统一框架非单调凸的联合算法(例如 Frank-Wolfe 算法) 为解决交通任务问题。Globalconvergence 结果在温和条件下面被建立。在我们的算法使用的线搜索过程包括非，单调 Armijo 统治，非单调 Goldstein 规则和 nonmonotoneWolfe 统治同样特殊的情况。那么，新算法能被看作常规凸的联合算法的归纳。
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.
基金
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.
