两阶段交通均衡交通流分配模型中寻找平衡点的加速坐标下降法

IF 0.7 4区 计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING Programming and Computer Software Pub Date : 2023-12-01 DOI:10.1134/s036176882306004x
N. A. Il’tyakov, M. A. Obozov, I. M. Dyshlevski, D. V. Yarmoshik, M. B. Kubentaeva, A. V. Gasnikov, E. V. Gasnikova
{"title":"两阶段交通均衡交通流分配模型中寻找平衡点的加速坐标下降法","authors":"N. A. Il’tyakov, M. A. Obozov, I. M. Dyshlevski, D. V. Yarmoshik, M. B. Kubentaeva, A. V. Gasnikov, E. V. Gasnikova","doi":"10.1134/s036176882306004x","DOIUrl":null,"url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>The search for equilibrium in a two-stage traffic flow model reduces to the solution of a special nonsmooth convex optimization problem with two groups of different variables. For numerical solution of this problem, it is proposed to use the accelerated block-coordinate Nesterov–Stich method with a special choice of block probabilities at each iteration. Theoretical estimates of the complexity of this approach can appreciably improve the estimates of previously used approaches. However, in the general case they do not guarantee faster convergence. Numerical experiments with the proposed algorithms are carried out.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On Accelerated Coordinate Descent Methods for Searching Equilibria in Two-Stage Transportation Equilibrium Traffic Flow Distribution Model\",\"authors\":\"N. A. Il’tyakov, M. A. Obozov, I. M. Dyshlevski, D. V. Yarmoshik, M. B. Kubentaeva, A. V. Gasnikov, E. V. Gasnikova\",\"doi\":\"10.1134/s036176882306004x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<h3 data-test=\\\"abstract-sub-heading\\\">Abstract</h3><p>The search for equilibrium in a two-stage traffic flow model reduces to the solution of a special nonsmooth convex optimization problem with two groups of different variables. For numerical solution of this problem, it is proposed to use the accelerated block-coordinate Nesterov–Stich method with a special choice of block probabilities at each iteration. Theoretical estimates of the complexity of this approach can appreciably improve the estimates of previously used approaches. However, in the general case they do not guarantee faster convergence. Numerical experiments with the proposed algorithms are carried out.</p>\",\"PeriodicalId\":54555,\"journal\":{\"name\":\"Programming and Computer Software\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Programming and Computer Software\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1134/s036176882306004x\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Programming and Computer Software","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1134/s036176882306004x","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

摘要

摘要两阶段交通流模型的均衡问题可归结为两组不同变量的特殊非光滑凸优化问题的求解。对于该问题的数值求解,提出了采用加速块坐标Nesterov-Stich方法,并在每次迭代时选择特定的块概率。对这种方法复杂性的理论估计可以显著地改进以前使用的方法的估计。然而,在一般情况下,它们不能保证更快的收敛。对所提出的算法进行了数值实验。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
On Accelerated Coordinate Descent Methods for Searching Equilibria in Two-Stage Transportation Equilibrium Traffic Flow Distribution Model

Abstract

The search for equilibrium in a two-stage traffic flow model reduces to the solution of a special nonsmooth convex optimization problem with two groups of different variables. For numerical solution of this problem, it is proposed to use the accelerated block-coordinate Nesterov–Stich method with a special choice of block probabilities at each iteration. Theoretical estimates of the complexity of this approach can appreciably improve the estimates of previously used approaches. However, in the general case they do not guarantee faster convergence. Numerical experiments with the proposed algorithms are carried out.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Programming and Computer Software
Programming and Computer Software 工程技术-计算机:软件工程
CiteScore
1.60
自引率
28.60%
发文量
35
审稿时长
>12 weeks
期刊介绍: Programming and Computer Software is a peer reviewed journal devoted to problems in all areas of computer science: operating systems, compiler technology, software engineering, artificial intelligence, etc.
期刊最新文献
Comparative Efficiency Analysis of Hashing Algorithms for Use in zk-SNARK Circuits in Distributed Ledgers Constructing the Internal Voronoi Diagram of Polygonal Figure Using the Sweepline Method RuGECToR: Rule-Based Neural Network Model for Russian Language Grammatical Error Correction Secure Messaging Application Development: Based on Post-Quantum Algorithms CSIDH, Falcon, and AES Symmetric Key Cryptosystem Analytical Review of Confidential Artificial Intelligence: Methods and Algorithms for Deployment in Cloud Computing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1