Pub Date : 2023-09-18DOI: 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}
Pub Date : 2023-09-16DOI: 10.1007/s11590-023-02055-z
Emilie Chouzenoux, Jean-Baptiste Fest
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.
{"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}
Pub Date : 2023-07-24DOI: 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}
Pub Date : 2023-07-21DOI: 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}
Pub Date : 2023-07-11DOI: 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}
Pub Date : 2023-07-10DOI: 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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：