Worst-case analysis of restarted primal-dual hybrid gradient on totally unimodular linear programs

IF 0.8 4区 管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Operations Research Letters Pub Date : 2024-10-15 DOI:10.1016/j.orl.2024.107199
{"title":"Worst-case analysis of restarted primal-dual hybrid gradient on totally unimodular linear programs","authors":"","doi":"10.1016/j.orl.2024.107199","DOIUrl":null,"url":null,"abstract":"<div><div>We analyze restarted PDHG on totally unimodular linear programs. In particular, we show that restarted PDHG finds an <em>ϵ</em>-optimal solution in <span><math><mi>O</mi><mo>(</mo><mi>H</mi><msubsup><mrow><mi>m</mi></mrow><mrow><mn>1</mn></mrow><mrow><mn>2.5</mn></mrow></msubsup><msqrt><mrow><mtext>nnz</mtext><mo>(</mo><mi>A</mi><mo>)</mo></mrow></msqrt><mi>log</mi><mo>⁡</mo><mo>(</mo><mi>H</mi><msub><mrow><mi>m</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>/</mo><mi>ϵ</mi><mo>)</mo><mo>)</mo></math></span> matrix-vector multiplies where <span><math><msub><mrow><mi>m</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span> is the number of constraints, <span><math><msub><mrow><mi>m</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span> the number of variables, <span><math><mtext>nnz</mtext><mo>(</mo><mi>A</mi><mo>)</mo></math></span> is the number of nonzeros in the constraint matrix, <em>H</em> is the largest absolute coefficient in the right hand side or objective vector, and <em>ϵ</em> is the distance to optimality of the outputted solution.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":null,"pages":null},"PeriodicalIF":0.8000,"publicationDate":"2024-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research Letters","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167637724001354","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0

Abstract

We analyze restarted PDHG on totally unimodular linear programs. In particular, we show that restarted PDHG finds an ϵ-optimal solution in O(Hm12.5nnz(A)log(Hm2/ϵ)) matrix-vector multiplies where m1 is the number of constraints, m2 the number of variables, nnz(A) is the number of nonzeros in the constraint matrix, H is the largest absolute coefficient in the right hand side or objective vector, and ϵ is the distance to optimality of the outputted solution.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
完全单模态线性程序上重启原始双混合梯度的最坏情况分析
我们分析了完全单模线性程序的重启 PDHG。我们特别指出,重启的 PDHG 能在 O(Hm12.5nnz(A)log(Hm2/ϵ)) 矩阵-向量乘法中找到ϵ-最优解,其中 m1 是约束条件的数量,m2 是变量的数量,nnz(A) 是约束矩阵中非zeros 的数量,H 是右侧或目标向量中最大的绝对系数,ϵ 是输出解到最优的距离。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Operations Research Letters
Operations Research Letters 管理科学-运筹学与管理科学
CiteScore
2.10
自引率
9.10%
发文量
111
审稿时长
83 days
期刊介绍: Operations Research Letters is committed to the rapid review and fast publication of short articles on all aspects of operations research and analytics. Apart from a limitation to eight journal pages, quality, originality, relevance and clarity are the only criteria for selecting the papers to be published. ORL covers the broad field of optimization, stochastic models and game theory. Specific areas of interest include networks, routing, location, queueing, scheduling, inventory, reliability, and financial engineering. We wish to explore interfaces with other fields such as life sciences and health care, artificial intelligence and machine learning, energy distribution, and computational social sciences and humanities. Our traditional strength is in methodology, including theory, modelling, algorithms and computational studies. We also welcome novel applications and concise literature reviews.
期刊最新文献
Break maximization for round-robin tournaments without consecutive breaks Anchored rescheduling problem with non-availability periods The circle packing problem: A theoretical comparison of various convexification techniques Structured pruning of neural networks for constraints learning Worst-case analysis of restarted primal-dual hybrid gradient on totally unimodular linear programs
×
引用
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