发布求助
文献互助 智能选刊 最新文献

Optimization Letters最新文献

筛选
英文 中文
A new feasible moving ball projection algorithm for pseudomonotone variational inequalities 伪单调变分不等式的一种新的可行的运动球投影算法
4区 数学
Optimization Letters Pub Date : 2023-09-19 DOI: 10.1007/s11590-023-02053-1
Limei Feng, Yongle Zhang, Yiran He
{"title":"A new feasible moving ball projection algorithm for pseudomonotone variational inequalities","authors":"Limei Feng, Yongle Zhang, Yiran He","doi":"10.1007/s11590-023-02053-1","DOIUrl":"https://doi.org/10.1007/s11590-023-02053-1","url":null,"abstract":"","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135015054","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Approximation algorithm for solving the 1-line Steiner tree problem with minimum number of Steiner points 求解具有最小斯坦纳点数的一行斯坦纳树问题的近似算法
4区 数学
Optimization Letters Pub Date : 2023-09-18 DOI: 10.1007/s11590-023-02058-w
Suding Liu
{"title":"Approximation algorithm for solving the 1-line Steiner tree problem with minimum number of Steiner points","authors":"Suding Liu","doi":"10.1007/s11590-023-02058-w","DOIUrl":"https://doi.org/10.1007/s11590-023-02058-w","url":null,"abstract":"","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"188 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135153957","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Convergence analysis of block majorize-minimize subspace approach 块最大化-最小化子空间方法的收敛性分析
4区 数学
Optimization Letters Pub Date : 2023-09-16 DOI: 10.1007/s11590-023-02055-z
Emilie Chouzenoux, Jean-Baptiste Fest
{"title":"Convergence analysis of block majorize-minimize subspace approach","authors":"Emilie Chouzenoux, Jean-Baptiste Fest","doi":"10.1007/s11590-023-02055-z","DOIUrl":"https://doi.org/10.1007/s11590-023-02055-z","url":null,"abstract":"We consider the minimization of a differentiable Lipschitz gradient but non necessarily convex, function F defined on $${mathbb {R}}^N$$ . We propose an accelerated gradient descent approach which combines three strategies, namely (i) a variable metric derived from the majorization-minimization principle; (ii) a subspace strategy incorporating information from the past iterates; (iii) a block alternating update. Under the assumption that F satisfies the Kurdyka–Łojasiewicz property, we give conditions under which the sequence generated by the resulting block majorize-minimize subspace algorithm converges to a critical point of the objective function, and we exhibit convergence rates for its iterates.","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135304611","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Variance reduced moving balls approximation method for smooth constrained minimization problems 光滑约束最小化问题的方差减少移动球近似方法
IF 1.6 4区 数学
Optimization Letters Pub Date : 2023-07-30 DOI: 10.1007/s11590-023-02049-x
Zhi-Chun Yang, F. Xia, K. Tu
{"title":"Variance reduced moving balls approximation method for smooth constrained minimization problems","authors":"Zhi-Chun Yang, F. Xia, K. Tu","doi":"10.1007/s11590-023-02049-x","DOIUrl":"https://doi.org/10.1007/s11590-023-02049-x","url":null,"abstract":"","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":" ","pages":""},"PeriodicalIF":1.6,"publicationDate":"2023-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43244909","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs 调度具有一般线性恶化的作业，以最小化延迟作业的加权总数
IF 1.6 4区 数学
Optimization Letters Pub Date : 2023-07-24 DOI: 10.1007/s11590-023-02039-z
Yifu Feng, Xin-Na Geng, Dan-Yang Lv, Ji-Bo Wang
{"title":"Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs","authors":"Yifu Feng, Xin-Na Geng, Dan-Yang Lv, Ji-Bo Wang","doi":"10.1007/s11590-023-02039-z","DOIUrl":"https://doi.org/10.1007/s11590-023-02039-z","url":null,"abstract":"","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":" ","pages":""},"PeriodicalIF":1.6,"publicationDate":"2023-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42403232","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Minimizing a complex quadratic fractional optimization problem with two second-order cone constraints 具有两个二阶锥约束的复二次分式优化问题的最小化
IF 1.6 4区 数学
Optimization Letters Pub Date : 2023-07-21 DOI: 10.1007/s11590-023-02044-2
Arezu Zare
{"title":"Minimizing a complex quadratic fractional optimization problem with two second-order cone constraints","authors":"Arezu Zare","doi":"10.1007/s11590-023-02044-2","DOIUrl":"https://doi.org/10.1007/s11590-023-02044-2","url":null,"abstract":"","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":" ","pages":""},"PeriodicalIF":1.6,"publicationDate":"2023-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45305938","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A linearized method for solving tensor complementarity problems with implicit Z-tensors 用隐式Z-张量求解张量互补问题的线性化方法
IF 1.6 4区 数学
Optimization Letters Pub Date : 2023-07-16 DOI: 10.1007/s11590-023-02043-3
Xionghui Zheng, Yong Wang, Zhenghai Huang
{"title":"A linearized method for solving tensor complementarity problems with implicit Z-tensors","authors":"Xionghui Zheng, Yong Wang, Zhenghai Huang","doi":"10.1007/s11590-023-02043-3","DOIUrl":"https://doi.org/10.1007/s11590-023-02043-3","url":null,"abstract":"","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":" ","pages":""},"PeriodicalIF":1.6,"publicationDate":"2023-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49312815","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A sequential reduction algorithm for the large-scale fixed-charge network flow problems 大规模固定收费网络流问题的序贯约简算法
IF 1.6 4区 数学
Optimization Letters Pub Date : 2023-07-13 DOI: 10.1007/s11590-023-02040-6
Lu Yang, Zhouwang Yang
{"title":"A sequential reduction algorithm for the large-scale fixed-charge network flow problems","authors":"Lu Yang, Zhouwang Yang","doi":"10.1007/s11590-023-02040-6","DOIUrl":"https://doi.org/10.1007/s11590-023-02040-6","url":null,"abstract":"","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":" ","pages":""},"PeriodicalIF":1.6,"publicationDate":"2023-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47744918","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
NPROS: A Not So Pure Random Orthogonal search algorithm—A suite of random optimization algorithms driven by reinforcement learning NPROS:一种不那么纯粹的随机正交搜索算法——一套由强化学习驱动的随机优化算法
IF 1.6 4区 数学
Optimization Letters Pub Date : 2023-07-11 DOI: 10.1007/s11590-023-02038-0
A. Hameed, Narendran Rajagopalan
{"title":"NPROS: A Not So Pure Random Orthogonal search algorithm—A suite of random optimization algorithms driven by reinforcement learning","authors":"A. Hameed, Narendran Rajagopalan","doi":"10.1007/s11590-023-02038-0","DOIUrl":"https://doi.org/10.1007/s11590-023-02038-0","url":null,"abstract":"","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":" ","pages":""},"PeriodicalIF":1.6,"publicationDate":"2023-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45114105","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Scheduling coupled tasks on parallel identical machines 在并行相同机器上调度耦合任务
IF 1.6 4区 数学
Optimization Letters Pub Date : 2023-07-10 DOI: 10.1007/s11590-023-02014-8
M. Khatami, Daniel Oron, A. Salehipour
{"title":"Scheduling coupled tasks on parallel identical machines","authors":"M. Khatami, Daniel Oron, A. Salehipour","doi":"10.1007/s11590-023-02014-8","DOIUrl":"https://doi.org/10.1007/s11590-023-02014-8","url":null,"abstract":"","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":" ","pages":""},"PeriodicalIF":1.6,"publicationDate":"2023-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45828846","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信