Sulaiman Mohammed Ibrahim, P. Kaelo, Rabiu B. Yunus, Aceng Sambas
{"title":"Global convergence of a modified CG-based method with Lipschitz continuity for unconstrained optimization and image restoration problems","authors":"Sulaiman Mohammed Ibrahim, P. Kaelo, Rabiu B. Yunus, Aceng Sambas","doi":"10.1007/s13370-026-01468-0","DOIUrl":null,"url":null,"abstract":"<div><p>In this study, we extend the recently proposed RMIL* method to construct a new three-term conjugate gradient (TTCG) direction and show that it possesses sufficient descent property independently of the line search strategy used. We further prove the global convergence of the method using the famous Wolfe line search conditions. The computational efficiency of the algorithm (method) is tested on a set of unconstrained optimization and image restoration problems. The Findings of the numerical experiments show that the proposed method is robust and promising for both unconstrained minimization and application problems.</p></div>","PeriodicalId":46107,"journal":{"name":"Afrika Matematika","volume":"37 3","pages":""},"PeriodicalIF":0.8000,"publicationDate":"2026-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s13370-026-01468-0.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Afrika Matematika","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.1007/s13370-026-01468-0","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
In this study, we extend the recently proposed RMIL* method to construct a new three-term conjugate gradient (TTCG) direction and show that it possesses sufficient descent property independently of the line search strategy used. We further prove the global convergence of the method using the famous Wolfe line search conditions. The computational efficiency of the algorithm (method) is tested on a set of unconstrained optimization and image restoration problems. The Findings of the numerical experiments show that the proposed method is robust and promising for both unconstrained minimization and application problems.