An Improved Three-Term Conjugate Gradient Algorithm for Constrained Nonlinear Equations under Non-Lipschitz Conditions and Its Applications

This paper proposes an improved three-term conjugate gradient algorithm designed to solve nonlinear equations with convex constraints. The key features of the proposed algorithm are as follows: (i) It only requires that nonlinear equations have continuous and monotone properties; (ii) The designed search direction inherently ensures sufficient descent and trust-region properties, eliminating the need for line search formulas; (iii) Global convergence is established without the necessity of the Lipschitz continuity condition. Benchmark problem numerical results illustrate the proposed algorithm’s effectiveness and competitiveness relative to other three-term algorithms. Additionally, the algorithm is extended to effectively address the image denoising problem.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2024-08-19
DOI
https://doi.org/10.3390/math12162556
Citations
5
Primary Topic
Sparse and Compressive Sensing Techniques
Type
article
Field-Weighted Citation Impact
1.87
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Improved Three-Term Conjugate Gradient Algorithm for Constrained Nonlinear Equations under Non-Lipschitz Conditions and Its Applications

Dandan Li, Songhua Wang, Yong Li
5 citations
Mathematics
Sparse and Compressive Sensing Techniques
1.87
article

An Improved Three-Term Conjugate Gradient Algorithm for Constrained Nonlinear Equations under Non-Lipschitz Conditions and Its Applications

Dandan Li, Songhua Wang, Yong Li
article en
5 citations

Abstract

This paper proposes an improved three-term conjugate gradient algorithm designed to solve nonlinear equations with convex constraints. The key features of the proposed algorithm are as follows: (i) It only requires that nonlinear equations have continuous and monotone properties; (ii) The designed search direction inherently ensures sufficient descent and trust-region properties, eliminating the need for line search formulas; (iii) Global convergence is established without the necessity of the Lipschitz continuity condition. Benchmark problem numerical results illustrate the proposed algorithm’s effectiveness and competitiveness relative to other three-term algorithms. Additionally, the algorithm is extended to effectively address the image denoising problem.

MathematicsVol. 12(16)
Guangzhou Automobile Group (China) (CN), Baise University (CN), Guangzhou Huashang College
Openalex Percentile: Top 16%
Sparse and Compressive Sensing Techniques
1.87
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.