Abstract
<p style='text-indent:20px;'>Iterative methods for nonlinear monotone equations do not require the differentiability assumption on the residual function. This special property of the methods makes them suitable for solving large-scale nonsmooth monotone equations. In this work, we present a diagonal Polak-Ribi<inline-formula><tex-math id="M1">\begin{document}$ \grave{e} $\end{document}</tex-math></inline-formula>re-Polyak (PRP) conjugate gradient-type method for solving large-scale nonlinear monotone equations with convex constraints. The search direction is a combine form of a multivariate (<i>diagonal</i>) spectral method and a modified PRP conjugate gradient method. Proper safeguards are devised to ensure positive definiteness of the diagonal matrix associated with the search direction. Based on Lipschitz continuity and monotonicity assumptions the method is shown to be globally convergent. Numerical results are presented by means of comparative experiments with recently proposed multivariate spectral Dai-Yuan-type (J. Ind. Manag. Optim. 13 (2017) 283-295) and Wei-Yao-Liu-type (Int. J. Comput. Math. 92 (2015) 2261-2272) conjugate gradient methods.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Industrial & Management Optimization
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
