Yizun Lin, Yongxin He, C Ross Schmidtlein, Deren Han
{"title":"An accelerated preconditioned proximal gradient algorithm with a generalized Nesterov momentum for PET image reconstruction.","authors":"Yizun Lin, Yongxin He, C Ross Schmidtlein, Deren Han","doi":"10.1088/1361-6420/adbd6a","DOIUrl":null,"url":null,"abstract":"<p><p>This paper presents an accelerated preconditioned proximal gradient algorithm (APPGA) for effectively solving a class of positron emission tomography (PET) image reconstruction models with differentiable regularizers. We establish the convergence of APPGA with the generalized Nesterov (GN) momentum scheme, demonstrating its ability to converge to a minimizer of the objective function with rates of <math><mi>o</mi> <mfenced><mrow><mn>1</mn> <mo>/</mo> <msup><mrow><mi>k</mi></mrow> <mrow><mn>2</mn> <mi>ω</mi></mrow> </msup> </mrow> </mfenced> </math> and <math><mi>o</mi> <mfenced><mrow><mn>1</mn> <mo>/</mo> <msup><mrow><mi>k</mi></mrow> <mrow><mi>ω</mi></mrow> </msup> </mrow> </mfenced> </math> in terms of the function value and the distance between consecutive iterates, respectively, where <math><mi>ω</mi> <mo>∈</mo> <mo>(</mo> <mn>0</mn> <mo>,</mo> <mn>1</mn> <mo>]</mo></math> is the power parameter of the GN momentum. To achieve an efficient algorithm with high-order convergence rate for the higher-order isotropic total variation (ITV) regularized PET image reconstruction model, we replace the ITV term by its smoothed version and subsequently apply APPGA to solve the smoothed model. Numerical results presented in this work indicate that as <math><mi>ω</mi> <mo>∈</mo> <mo>(</mo> <mn>0</mn> <mo>,</mo> <mn>1</mn> <mo>]</mo></math> increase, APPGA converges at a progressively faster rate. Furthermore, APPGA exhibits superior performance compared to the preconditioned proximal gradient algorithm and the preconditioned Krasnoselskii-Mann algorithm. The extension of the GN momentum technique for solving a more complex optimization model with multiple nondifferentiable terms is also discussed.</p>","PeriodicalId":50275,"journal":{"name":"Inverse Problems","volume":"41 4","pages":""},"PeriodicalIF":2.1000,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12456403/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Inverse Problems","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1088/1361-6420/adbd6a","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/3/14 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
This paper presents an accelerated preconditioned proximal gradient algorithm (APPGA) for effectively solving a class of positron emission tomography (PET) image reconstruction models with differentiable regularizers. We establish the convergence of APPGA with the generalized Nesterov (GN) momentum scheme, demonstrating its ability to converge to a minimizer of the objective function with rates of and in terms of the function value and the distance between consecutive iterates, respectively, where is the power parameter of the GN momentum. To achieve an efficient algorithm with high-order convergence rate for the higher-order isotropic total variation (ITV) regularized PET image reconstruction model, we replace the ITV term by its smoothed version and subsequently apply APPGA to solve the smoothed model. Numerical results presented in this work indicate that as increase, APPGA converges at a progressively faster rate. Furthermore, APPGA exhibits superior performance compared to the preconditioned proximal gradient algorithm and the preconditioned Krasnoselskii-Mann algorithm. The extension of the GN momentum technique for solving a more complex optimization model with multiple nondifferentiable terms is also discussed.
期刊介绍:
An interdisciplinary journal combining mathematical and experimental papers on inverse problems with theoretical, numerical and practical approaches to their solution.
As well as applied mathematicians, physical scientists and engineers, the readership includes those working in geophysics, radar, optics, biology, acoustics, communication theory, signal processing and imaging, among others.
The emphasis is on publishing original contributions to methods of solving mathematical, physical and applied problems. To be publishable in this journal, papers must meet the highest standards of scientific quality, contain significant and original new science and should present substantial advancement in the field. Due to the broad scope of the journal, we require that authors provide sufficient introductory material to appeal to the wide readership and that articles which are not explicitly applied include a discussion of possible applications.