Kangming Chen , Ellen Hidemi Fukuda , Hiroyuki Sato
{"title":"Nonlinear conjugate gradient method for vector optimization on Riemannian manifolds with retraction and vector transport","authors":"Kangming Chen , Ellen Hidemi Fukuda , Hiroyuki Sato","doi":"10.1016/j.amc.2024.129001","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper, we propose nonlinear conjugate gradient methods for vector optimization on Riemannian manifolds. The concepts of Wolfe and Zoutendjik conditions are extended to Riemannian manifolds. Specifically, the existence of intervals of step sizes that satisfy the Wolfe conditions is established. The convergence analysis covers the vector extensions of the Fletcher–Reeves, conjugate descent, and Dai–Yuan parameters. Under some assumptions, we prove that the sequence obtained by the proposed algorithm can converge to a Pareto stationary point. Moreover, several other choices of the parameter are discussed. Numerical experiments illustrating the practical behavior of the methods are presented.</p></div>","PeriodicalId":3,"journal":{"name":"ACS Applied Electronic Materials","volume":null,"pages":null},"PeriodicalIF":4.3000,"publicationDate":"2024-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACS Applied Electronic Materials","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0096300324004624","RegionNum":3,"RegionCategory":"材料科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we propose nonlinear conjugate gradient methods for vector optimization on Riemannian manifolds. The concepts of Wolfe and Zoutendjik conditions are extended to Riemannian manifolds. Specifically, the existence of intervals of step sizes that satisfy the Wolfe conditions is established. The convergence analysis covers the vector extensions of the Fletcher–Reeves, conjugate descent, and Dai–Yuan parameters. Under some assumptions, we prove that the sequence obtained by the proposed algorithm can converge to a Pareto stationary point. Moreover, several other choices of the parameter are discussed. Numerical experiments illustrating the practical behavior of the methods are presented.