Abstract

In this paper, based on projection technique Solodove and Svaiter (Reformulation: Nonsmooth, piecewise smooth, semismooth and smoothing methods; 355-369,1995 ), we propose a decent improved three-term derivative free approach for solving nonlinear monotone equations with convex constraints. The algorithm combines the spectral gradient parameter with a newly PRPlike CG coefficient in the search direction. The global convergence of the proposed approach established under standard conditions. Additionally, using some benchmark problems, the numerical results highlight the outstanding performance of this approach compared to popular conjugate gradient methods. The experiments also show its effectiveness in solving large-scale nonlinear equations with convex constraints.

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 call

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.