A three-term CGPM-based algorithm without Lipschitz continuity for constrained nonlinear monotone equations with applications

In this work, a new three-term conjugate gradient projection method (CGPM) with a new adaptive line search strategy is proposed for solving the large-scale nonlinear monotone equations with convex constraints. The proposed three-term CGPM-based algorithm has the following characteristics: (i) its se...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Applied numerical mathematics Jg. 175; S. 98 - 107
Hauptverfasser: Liu, Pengjie, Shao, Hu, Wang, Yun, Wu, Xiaoyu
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.05.2022
Schlagworte:
Adaptive line search strategy
Compressed sensing
Conjugate gradient projection method
Convergence property
Nonlinear monotone equations
Nonlinear monotone equations
Conjugate gradient projection method
Adaptive line search strategy
Convergence property
Compressed sensing
ISSN:0168-9274, 1873-5460
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this work, a new three-term conjugate gradient projection method (CGPM) with a new adaptive line search strategy is proposed for solving the large-scale nonlinear monotone equations with convex constraints. The proposed three-term CGPM-based algorithm has the following characteristics: (i) its search direction satisfies the sufficient descent and trust region properties which is independent of the line search; (ii) the nonlinear equations only satisfy continuous and monotone properties; (iii) its global convergence is analyzed and obtained without the Lipschitz continuity. Some preliminary numerical experiment results are reported and their corresponding performance profiles are illustrated, which show that the proposed algorithm is effective. Finally, the proposed algorithm is extended to solve sparse signal restoration problems.
ISSN:0168-9274
1873-5460
DOI:10.1016/j.apnum.2022.02.001