A descent derivative-free algorithm for nonlinear monotone equations with convex constraints (original) (raw)

RAIRO - Operations Research

In this paper, we present a derivative-free algorithm for nonlinear monotone equations with convex constraints. The search direction is a product of a positive parameter and the negation of a residual vector. At each iteration step, the algorithm generates a descent direction independent from the line search used. Under appropriate assumptions, the global convergence of the algorithm is given. Numerical experiments show the algorithm has advantages over the recently proposed algorithms by Gao and He (Calcolo 55 (2018) 53) and Liu and Li (Comput. Math. App. 70 (2015) 2442–2453).

Sign up for access to the world's latest research.

checkGet notified about relevant papers

checkSave papers to use in your research

checkJoin the discussion with peers

checkTrack your impact