Nasiru Salihu , Poom Kumam , Sani Salisu , Lin Wang , Kanokwan Sitthithakerngkiet
{"title":"A revised MRMIL Riemannian conjugate gradient method with simplified global convergence properties","authors":"Nasiru Salihu , Poom Kumam , Sani Salisu , Lin Wang , Kanokwan Sitthithakerngkiet","doi":"10.1016/j.apnum.2025.03.007","DOIUrl":null,"url":null,"abstract":"<div><div>In this work, we propose an effective coefficient for the conjugate gradient (CG) method. First, we present the coefficient for Euclidean optimization, explaining its motivation, and then extend it to Riemannian optimization. We analyze the convergence of the CG method generated by this coefficient in the context of Riemannian optimization, ensuring that the generated search direction satisfies the sufficient descent property. This property ensures that the sequence generated converges to a minimizer of the underlying function. We test the effectiveness of the proposed coefficient numerically on various Riemannian optimization problems, demonstrating favorable performance compared to existing Riemannian CG methods and other coefficients of similar class. These results also extend to Euclidean optimization, where such findings have not yet been established.</div></div>","PeriodicalId":8199,"journal":{"name":"Applied Numerical Mathematics","volume":"214 ","pages":""},"PeriodicalIF":2.2000,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Numerical Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0168927425000698","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
In this work, we propose an effective coefficient for the conjugate gradient (CG) method. First, we present the coefficient for Euclidean optimization, explaining its motivation, and then extend it to Riemannian optimization. We analyze the convergence of the CG method generated by this coefficient in the context of Riemannian optimization, ensuring that the generated search direction satisfies the sufficient descent property. This property ensures that the sequence generated converges to a minimizer of the underlying function. We test the effectiveness of the proposed coefficient numerically on various Riemannian optimization problems, demonstrating favorable performance compared to existing Riemannian CG methods and other coefficients of similar class. These results also extend to Euclidean optimization, where such findings have not yet been established.
期刊介绍:
The purpose of the journal is to provide a forum for the publication of high quality research and tutorial papers in computational mathematics. In addition to the traditional issues and problems in numerical analysis, the journal also publishes papers describing relevant applications in such fields as physics, fluid dynamics, engineering and other branches of applied science with a computational mathematics component. The journal strives to be flexible in the type of papers it publishes and their format. Equally desirable are:
(i) Full papers, which should be complete and relatively self-contained original contributions with an introduction that can be understood by the broad computational mathematics community. Both rigorous and heuristic styles are acceptable. Of particular interest are papers about new areas of research, in which other than strictly mathematical arguments may be important in establishing a basis for further developments.
(ii) Tutorial review papers, covering some of the important issues in Numerical Mathematics, Scientific Computing and their Applications. The journal will occasionally publish contributions which are larger than the usual format for regular papers.
(iii) Short notes, which present specific new results and techniques in a brief communication.