On the convergence of conditional gradient method for unbounded multiobjective optimization problems

IF 0.9 4区 管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Wang Chen , Yong Zhao , Liping Tang , Xinmin Yang
{"title":"On the convergence of conditional gradient method for unbounded multiobjective optimization problems","authors":"Wang Chen ,&nbsp;Yong Zhao ,&nbsp;Liping Tang ,&nbsp;Xinmin Yang","doi":"10.1016/j.orl.2025.107366","DOIUrl":null,"url":null,"abstract":"<div><div>This paper focuses on developing the conditional gradient algorithm with adaptive step size for multiobjective optimization problems on unbounded feasible regions. By employing the recession cone, we establish the well-defined nature of the algorithm. Under mild assumptions, we obtain the asymptotic convergence property and the iteration-complexity bound. Furthermore, a new variant of the algorithm is proposed, and the rate of convergence of this variant is obtained. Numerical experiments are conducted to verify the performance of the algorithms.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"63 ","pages":"Article 107366"},"PeriodicalIF":0.9000,"publicationDate":"2025-09-11","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/S0167637725001270","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

This paper focuses on developing the conditional gradient algorithm with adaptive step size for multiobjective optimization problems on unbounded feasible regions. By employing the recession cone, we establish the well-defined nature of the algorithm. Under mild assumptions, we obtain the asymptotic convergence property and the iteration-complexity bound. Furthermore, a new variant of the algorithm is proposed, and the rate of convergence of this variant is obtained. Numerical experiments are conducted to verify the performance of the algorithms.
无界多目标优化问题的条件梯度法的收敛性
研究了无界可行域上多目标优化问题的自适应步长条件梯度算法。通过使用衰退锥,我们建立了算法的良好定义性质。在温和的假设条件下,我们得到了该算法的渐近收敛性和迭代复杂度界。在此基础上,提出了该算法的一种新变体,并得到了该变体的收敛速度。通过数值实验验证了算法的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信