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
- Dandan Li (ORCID: https://orcid.org/0000-0003-1840-4014)
- Songhua Wang (ORCID: https://orcid.org/0000-0001-8024-5056)
- Yong Li (ORCID: https://orcid.org/0000-0002-8135-7524)
Institutions
- Guangzhou Automobile Group (China) (CN)
- Baise University (CN)
- Guangzhou Huashang College
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