An Inertial-Based Hybrid PRP-HS-Type CGP Algorithm for Nonlinear Equations With Convex Constraints and Its Applications

Yan Xia and Dandan Li

International Journal of Mathematics and Mathematical Sciences, 2026, vol. 2026, 1-17

Abstract: This paper presents an inertial-based hybrid conjugate gradient projection algorithm for solving nonlinear equations with convex constraints. The proposed algorithm integrates Polak–Ribière–Polyak and Hestenes–Stiefel methods within a conjugate gradient framework, incorporating an inertial-relaxed technique to accelerate iterative convergence. At each iteration, an inertial extrapolation step is employed to enhance the next iterate, followed by a projection step that ensures feasibility. The search direction satisfies both the sufficient descent and trust region properties without relying on line search approaches. Global convergence is established under weak and mild assumptions. Extensive numerical experiments demonstrate that the proposed algorithm is efficient and competitive relative to existing methods. Furthermore, the practical applicability of the proposed algorithm is illustrated through its successful implementation in image denoising problems.

Date: 2026
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/ijmms/2026/9403730.pdf (application/pdf)
http://downloads.hindawi.com/journals/ijmms/2026/9403730.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:9403730

DOI: 10.1155/ijmm/9403730

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().