article · Franklin Open
A lot of researchers have introduced iterative schemes for solving convex constrained nonlinear monotone equations. This paper aims to propose a modified three-term of Dai–Yuan type (TTDY) derivative-free algorithm for nonlinear monotone equations. The presented method has a low storage requirement, it can therefore easily solve large scale nonlinear equations. At every iteration, it generates a descent search direction independent of the line search. We established the global convergence of the propose approach under standard conditions. Numerical examples are given to illustrate the effectiveness of the algorithm when solving large-scale nonlinear monotone equations. Finally, the capacity of the proposed algorithm has been tested to solve nonlinear monotone equations equivalent to the ℓ 1 -norm regularized minimization problem.
This page summarises published work. The authoritative version sits with the publisher.
DOI: 10.1016/j.fraope.2025.100255
Is something wrong with this record? Report it or request removal.
Discussion
Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.
No discussion yet. Open the first thread.
New to MARATTO™? Create a free account.