A family of three-term conjugate gradient projection methods with a restart procedure and their relaxed-inertial extensions for the constrained nonlinear pseudo-monotone equations with applications

Al-Baali et al. ( Comput. Optim. Appl. 60:89–110, 2015) have proposed a three-term conjugate gradient method which satisfies a sufficient descent condition and global convergence. In this paper, we extend this method to a family of three-term conjugate gradient projection methods with a restart proc...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Numerical algorithms Jg. 94; H. 3; S. 1055 - 1083
Hauptverfasser:	Liu, Pengjie, Shao, Hu, Yuan, Zihang, Wu, Xiaoyu, Zheng, Tianlei
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.11.2023 Springer Nature B.V
Schlagworte:	Algebra Algorithms Computer Science Conjugate gradient method Continuity (mathematics) Convergence Iterative methods Mathematical analysis Methods Nonlinear equations Numeric Computing Numerical Analysis Optimization Original Paper Regression analysis Theory of Computation Logistic regression Global convergence 65K05 90C30 90C56 Nonlinear pseudo-monotone equations Relaxed-inertial strategy Conjugate gradient projection method Compressed sensing
ISSN:	1017-1398, 1572-9265
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!