An efficient Dai-Kou-type method with image de-blurring application

Iranian Journal of Numerical Analysis and Optimization

مقاله 12، دوره 15، Issue 3 - شماره پیاپی 34، آذر 2025، صفحه 1171-1209   

نوع مقاله: Research Article

شناسه دیجیتال (DOI): 10.22067/ijnao.2025.92708.1615

نویسندگان

K. Ahmed^{* 1}؛ M.Y. Waziri¹؛ S. Murtala²؛ A.S. Halilu^{3، 4}؛ H. Abdullahi³؛ Y.B. Musa³

¹Department of Mathematical Sciences, Bayero University, Kano, Nigeria.

²Department of Mathematics, Federal University, Dutse, Nigeria.

³Department of Mathematics, Sule Lamido University, Kafin Hausa, Nigeria.

⁴Faculty of Informatics and Computing, Universiti Sultan Zainal Abidin, Campus Besut, 22200 Terengganu, Malaysia

چکیده

Well-conditioning of matrices has been shown to improve the numerical performance of algorithms by way of ensuring their numerical stability. In this paper, a modified Dai–Kou-type conjugate gradient method is developed for constrained nonlinear monotone systems by employing the well conditioning approach. The new method ensures that the much required condition for global convergence of iterates generated is satisfied irrespective of the linesearch strategy employed. Another novelty of the scheme is its practical application in image de-blurring problems. The method performs well and converges globally under mild assumptions. Experiments in image de-blurring and convex constrained systems of equations, show the scheme to be effective.

کلیدواژه‌ها

Nonlinear equations؛ Eigenvalues؛ Constrained equations؛ Convex set؛ Sparse signals

مراجع