2022
DOI: 10.1016/j.matcom.2021.07.005
|View full text |Cite
|
Sign up to set email alerts
|

New hybrid three-term spectral-conjugate gradient method for finding solutions of nonlinear monotone operator equations with applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
14
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
2

Relationship

3
4

Authors

Journals

citations
Cited by 18 publications
(14 citation statements)
references
References 31 publications
0
14
0
Order By: Relevance
“…Nonlinear monotone equations also arise in signal and image recovery problems. Due to their simplicity and low storage requirements [38], CG-type algorithms are currently widely used to solve (1). It also generates sequence of iterates {x k } via…”
Section: Introductionmentioning
confidence: 99%
“…Nonlinear monotone equations also arise in signal and image recovery problems. Due to their simplicity and low storage requirements [38], CG-type algorithms are currently widely used to solve (1). It also generates sequence of iterates {x k } via…”
Section: Introductionmentioning
confidence: 99%
“…The CG-type methods are popular nowadays for solving (1), because of their simplicity and low storage requirements. Precisely, the hybridization of CG methods is currently an interesting approach used to design an efficient algorithms for solving (1).…”
Section: Introductionmentioning
confidence: 99%
“…In [16], the authors presented a hybrid CG algorithm in which the hybridized parameter contains the modified versions of the Hestenes-Stiefel and Polak-Ribiére-Polyak CG parameters. Waziri et al [24] considered an improved CG-like algorithm for solving (1) via the convex hybridization of the Fletcher-Reeves (FR) and Polak-Ribiére-Polyak (PRP) parameters. The hybrid method was proven to converge globally and numerically efficient.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…More precisely, the CG method has been paid attention to as an effective numerical method for solving large‐scale unconstrained optimization problems because of its simplicity and low storage 7,8 . Thus, using the projection technique in Solodov and Svaiter, 9 several researchers extended these methods resulting in derivative‐free methods (see References 10‐33 and references therein). Recently, based on Hestenes–Stiefel (HS) CG method 34 for unconstrained optimization, Wang et al 35 proposed a self‐adaptive three‐term derivative‐free method for solving monotone nonlinear equations with convex constraints.…”
Section: Introductionmentioning
confidence: 99%