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

Optimization Methods and Software最新文献

筛选
英文 中文
A family of limited memory three term conjugate gradient methods 有限记忆三项共轭梯度法系列
Optimization Methods and Software Pub Date : 2024-05-23 DOI: 10.1080/10556788.2024.2329591
Min Li, Minru Bai
{"title":"A family of limited memory three term conjugate gradient methods","authors":"Min Li, Minru Bai","doi":"10.1080/10556788.2024.2329591","DOIUrl":"https://doi.org/10.1080/10556788.2024.2329591","url":null,"abstract":"","PeriodicalId":124811,"journal":{"name":"Optimization Methods and Software","volume":"36 38","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141104078","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Maximizing the number of rides served for time-limited Dial-a-Ride* 最大限度地提高限时拨号乘车服务的乘车次数*。
Optimization Methods and Software Pub Date : 2024-05-23 DOI: 10.1080/10556788.2024.2349091
B. M. Anthony, Christine Chung, Ananya Das, David S. Yuen
{"title":"Maximizing the number of rides served for time-limited Dial-a-Ride*","authors":"B. M. Anthony, Christine Chung, Ananya Das, David S. Yuen","doi":"10.1080/10556788.2024.2349091","DOIUrl":"https://doi.org/10.1080/10556788.2024.2349091","url":null,"abstract":"","PeriodicalId":124811,"journal":{"name":"Optimization Methods and Software","volume":"56 4","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141103294","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A semismooth conjugate gradients method – theoretical analysis 半光滑共轭梯度法--理论分析
Optimization Methods and Software Pub Date : 2024-05-23 DOI: 10.1080/10556788.2024.2331068
Franz Bethke, A. Griewank, Andrea Walther
{"title":"A semismooth conjugate gradients method – theoretical analysis","authors":"Franz Bethke, A. Griewank, Andrea Walther","doi":"10.1080/10556788.2024.2331068","DOIUrl":"https://doi.org/10.1080/10556788.2024.2331068","url":null,"abstract":"In large scale applications, deterministic and stochastic variants of Cauchy’s steepest descent method are widely used for the minimization of objectives that are only piecewise smooth. In this paper we analyse a deterministic descent method based on the generalization of rescaled conjugate gradients proposed by Philip Wolfe in 1975 for objectives that are convex. Without this assumption the new method exploits semismoothness to obtain pairs of directionally active generalized gradients such that it can only converge to Clarke stationary points. Numerical results illustrate the theoretical findings.","PeriodicalId":124811,"journal":{"name":"Optimization Methods and Software","volume":"15 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141106251","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Robust reverse 1-center problems on trees with interval costs 有区间成本的树上稳健反向 1 中心问题
Optimization Methods and Software Pub Date : 2024-05-21 DOI: 10.1080/10556788.2024.2346642
J. Tayyebi, Kien Trung Nguyen
{"title":"Robust reverse 1-center problems on trees with interval costs","authors":"J. Tayyebi, Kien Trung Nguyen","doi":"10.1080/10556788.2024.2346642","DOIUrl":"https://doi.org/10.1080/10556788.2024.2346642","url":null,"abstract":"","PeriodicalId":124811,"journal":{"name":"Optimization Methods and Software","volume":"66 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141116803","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A mixed-integer programming formulation for optimizing the double row layout problem 优化双行布局问题的混合整数编程公式
Optimization Methods and Software Pub Date : 2024-05-21 DOI: 10.1080/10556788.2024.2349093
André R. S. Amaral
{"title":"A mixed-integer programming formulation for optimizing the double row layout problem","authors":"André R. S. Amaral","doi":"10.1080/10556788.2024.2349093","DOIUrl":"https://doi.org/10.1080/10556788.2024.2349093","url":null,"abstract":"","PeriodicalId":124811,"journal":{"name":"Optimization Methods and Software","volume":"143 4","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141114484","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Computing subgradients of convex relaxations for solutions of parametric ordinary differential equations 计算参数常微分方程解的凸松弛子梯度
Optimization Methods and Software Pub Date : 2024-05-21 DOI: 10.1080/10556788.2024.2346641
Yingkai Song, Kamil A. Khan
{"title":"Computing subgradients of convex relaxations for solutions of parametric ordinary differential equations","authors":"Yingkai Song, Kamil A. Khan","doi":"10.1080/10556788.2024.2346641","DOIUrl":"https://doi.org/10.1080/10556788.2024.2346641","url":null,"abstract":"","PeriodicalId":124811,"journal":{"name":"Optimization Methods and Software","volume":"30 11","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141117524","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
PathWyse: a flexible, open-source library for the resource constrained shortest path problem PathWyse：资源受限最短路径问题的灵活开源库
Optimization Methods and Software Pub Date : 2024-02-05 DOI: 10.1080/10556788.2023.2296978
Matteo Salani, Saverio Basso, Vincenzo Giuffrida
{"title":"PathWyse: a flexible, open-source library for the resource constrained shortest path problem","authors":"Matteo Salani, Saverio Basso, Vincenzo Giuffrida","doi":"10.1080/10556788.2023.2296978","DOIUrl":"https://doi.org/10.1080/10556788.2023.2296978","url":null,"abstract":"","PeriodicalId":124811,"journal":{"name":"Optimization Methods and Software","volume":"95 3","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139803173","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
PathWyse: a flexible, open-source library for the resource constrained shortest path problem PathWyse：资源受限最短路径问题的灵活开源库
Optimization Methods and Software Pub Date : 2024-02-05 DOI: 10.1080/10556788.2023.2296978
Matteo Salani, Saverio Basso, Vincenzo Giuffrida
{"title":"PathWyse: a flexible, open-source library for the resource constrained shortest path problem","authors":"Matteo Salani, Saverio Basso, Vincenzo Giuffrida","doi":"10.1080/10556788.2023.2296978","DOIUrl":"https://doi.org/10.1080/10556788.2023.2296978","url":null,"abstract":"","PeriodicalId":124811,"journal":{"name":"Optimization Methods and Software","volume":"131 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139862663","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Delay-tolerant distributed Bregman proximal algorithms 容错分布式布雷格曼近端算法
Optimization Methods and Software Pub Date : 2024-01-24 DOI: 10.1080/10556788.2023.2278089
S. Chraibi, F. Iutzeler, J. Malick, A. Rogozin
{"title":"Delay-tolerant distributed Bregman proximal algorithms","authors":"S. Chraibi, F. Iutzeler, J. Malick, A. Rogozin","doi":"10.1080/10556788.2023.2278089","DOIUrl":"https://doi.org/10.1080/10556788.2023.2278089","url":null,"abstract":"","PeriodicalId":124811,"journal":{"name":"Optimization Methods and Software","volume":"52 18","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139599639","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The use of a family of Gerstewitz scalarization functions in the context of vector optimization with variable domination structures to derive scalarization results 在具有可变支配结构的矢量优化中使用格斯特威茨标量化函数族推导标量化结果
Optimization Methods and Software Pub Date : 2024-01-19 DOI: 10.1080/10556788.2023.2296440
L. Q. Anh, T. N. Tam
{"title":"The use of a family of Gerstewitz scalarization functions in the context of vector optimization with variable domination structures to derive scalarization results","authors":"L. Q. Anh, T. N. Tam","doi":"10.1080/10556788.2023.2296440","DOIUrl":"https://doi.org/10.1080/10556788.2023.2296440","url":null,"abstract":"","PeriodicalId":124811,"journal":{"name":"Optimization Methods and Software","volume":"91 8","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139612886","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"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学术官方微信