<p>The forward-backward splitting method is an efficient method to solve the separable convex minimization problem, which is given by differentiable and non-differentiable terms. In this paper, inspired by Nesterov’s accelerated first-order iterative method, we propose an accelerated double forward-backward splitting method, which is based on two forward-backward steps and a modified extrapolation step. In addition, the proposed method is obtained by a convex combination at each iteration. Under general conditions, by exploiting the convexity of the function and applying a correction to the sequence <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40305_2025_595_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="36" /> </InlineMediaObject> <EquationSource Format="TEX">\(\{ t_k \}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">{</mo> <msub> <mi>t</mi> <mi>k</mi> </msub> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation>, we prove that the convergence rate of the new method is <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40305_2025_595_Article_IEq3.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="59" /> </InlineMediaObject> <EquationSource Format="TEX">\(O(1/{k^2} )\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>O</mi> <mo stretchy="false">(</mo> <mn>1</mn> <mo stretchy="false">/</mo> <msup> <mi>k</mi> <mn>2</mn> </msup> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>. Finally, we provide some numerical tests on image deblurring problem. Numerical experiments are performed to show that our proposed method is effective.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

An Accelerated Double Forward-Backward Splitting Method with Applications in Image Restoration

  • Zhi-Bin Zhu,
  • Xiao-Wen Zhu,
  • Zhen Tan

摘要

The forward-backward splitting method is an efficient method to solve the separable convex minimization problem, which is given by differentiable and non-differentiable terms. In this paper, inspired by Nesterov’s accelerated first-order iterative method, we propose an accelerated double forward-backward splitting method, which is based on two forward-backward steps and a modified extrapolation step. In addition, the proposed method is obtained by a convex combination at each iteration. Under general conditions, by exploiting the convexity of the function and applying a correction to the sequence \(\{ t_k \}\) { t k } , we prove that the convergence rate of the new method is \(O(1/{k^2} )\) O ( 1 / k 2 ) . Finally, we provide some numerical tests on image deblurring problem. Numerical experiments are performed to show that our proposed method is effective.