Pub Date : 2024-05-23DOI: 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}
Pub Date : 2024-05-23DOI: 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}
Pub Date : 2024-05-23DOI: 10.1080/10556788.2024.2331068
Franz Bethke, A. Griewank, Andrea Walther
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.
在大规模应用中，Cauchy 最陡梯度下降法的确定性和随机变体被广泛用于片断平滑目标的最小化。在本文中，我们分析了一种基于 Philip Wolfe 于 1975 年提出的重增量共轭梯度广义的确定性下降法，该方法适用于凸目标。在没有这一假设的情况下，新方法利用半滑性获得了一对方向上活跃的广义梯度，因此它只能收敛到克拉克静止点。数值结果说明了理论发现。
{"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}
Pub Date : 2024-05-21DOI: 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}
Pub Date : 2024-05-21DOI: 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}
Pub Date : 2024-05-21DOI: 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}
Pub Date : 2024-01-24DOI: 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}
Pub Date : 2024-01-19DOI: 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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：