In this work, by considering the hyperplane projection and hybrid techniques, three scaled
three‐term conjugate gradient methods are extended to solve the system of constrained …

A one-parameter extension of the modified Polak–Ribière–Polyak method proposed by Sun
and Liu is developed based on the Dai–Liao approach. Two adaptive choices for the …

In this paper, we propose a three-term derivative-free projection algorithm for handling large-
scale nonlinear monotone equations with convex constrained. The search direction …

In this paper, two effective derivative-free methods are proposed for solving large-scale
nonlinear monotone equations, in which the search directions are sufficiently descent and …

To strengthen the three-term Hestenes–Stiefel conjugate gradient method proposed by
Zhang et al., we suggest a modified version of it. For this purpose, by considering the Dai …

This paper proposes a modified scaled spectral‐conjugate‐based algorithm for finding
solutions to monotone operator equations. The algorithm is a modification of the work of Li …

This article presents a family of self-scaling Polak–Ribière–Polyak (PRP) conjugate gradient
(CG) directions for unconstrained optimization. The first scaled parameter is derived from the …

In this paper, we propose two self-adaptive derivative-free methods with restart procedure
for solving large-scale constrained nonlinear equations. The new methods combine …

To solve a large-scale unconstrained optimization problem, in this paper we propose a class
of spectral three-term conjugate gradient methods. We indicate that the proposed class, in …

Abstract Recently, Peyghami et al.(Optim Meth Soft 43: 1–28, 2015) proposed a modified
secant equation, which applied a new updating Yabe and Takano's rule as an adaptive …