A modified PRP-type conjugate gradient projection algorithm for solving large-scale monotone nonlinear equations with convex constraint

• Published in: Journal of computational and applied mathematics 2022-06, Vol.407, p.114035, Article 114035
• Main Authors: Waziri, Mohammed Yusuf, Ahmed, Kabiru, Halilu, Abubakar Sani
• Format: Article
• Language: English
• Subjects: Backtracking Line search; Bounded sequence; Convex constraint; Descent condition; Monotone equations; Non-smooth functions
• ISSN: 0377-0427; 1879-1778
• DOI: 10.1016/j.cam.2021.114035

Conjugate gradient methods stand out as the most ideal iterative algorithms for solving nonlinear system of equations with large-dimensions. This is due to the fact that they are implemented with less memory and because of their ability to converge globally to solutions of problems considered. One of the most essential iterative method in this category is the Polak–Ribière–Polyak (PRP) scheme, which is numerically effective, but its search directions are mostly not descent directions. In this paper, based upon the adaptive PRP scheme by Yuan et al. and the projection method, a numerically efficient PRP-type scheme for system of monotone nonlinear equations is presented, where the solution is restricted to a closed convex set. Apart from the ability to satisfy the condition that is quite vital for global convergence, a distinct novelty of the new scheme is its application in compressive sensing, where it is applied to restore blurry images. The scheme’s global convergence is established with mild assumptions. Preliminary numerical results show that the method proposed is promising.