Abstract

Iterative methods for solving constraint nonlinear monotone equations have been developed and improved by many researchers. The aim of this research is to present a modified three-term conjugate descent (TTCD) derivative-free method for constrained nonlinear monotone equations. The proposed algorithm requires low storage memory; therefore, it has the capability to solve large-scale nonlinear equations. The algorithm generates a descent and bounded search direction dk at every iteration independent of the line search. The method is shown to be globally convergent under monotonicity and Lipschitz continuity conditions. Numerical results show that the suggested method can serve as an alternative to find the approximate solutions of nonlinear monotone equations. Furthermore, the method is promising for the reconstruction of sparse signal problems.

Full Text
Published version (Free)

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