An improved LS-RMIL-type conjugate gradient projection algorithm for systems of nonlinear equations and impulse noise image restoration

This paper proposes an improved LS-RMIL-type conjugate gradient projection algorithm designed for solving systems of nonlinear equations with convex constraints. The algorithm introduces a search direction that maintains sufficient descent and trust-region properties independent of the line search approach. It operates under relatively mild conditions, requiring only continuity and monotonicity of nonlinear equations, thus avoiding the need for stronger assumptions such as Lipschitz continuity. The global convergence of the algorithm is established under these relaxed conditions. Furthermore, numerical experiments demonstrate that the algorithm exhibits superior efficiency and stability, particularly in solving large-scale nonlinear systems and in applications such as impulse noise image restoration, outperforming existing methods.

Authors

Institutions

Publication Details

Journal
AIMS Mathematics
Published
2025-01-01
DOI
https://doi.org/10.3934/math.2025614
Citations
1
Primary Topic
Sparse and Compressive Sensing Techniques
Type
article
Field-Weighted Citation Impact
1.33
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An improved LS-RMIL-type conjugate gradient projection algorithm for systems of nonlinear equations and impulse noise image restoration

and Dandan Li, Xuejie Ma, Xia Yan
1 citations
AIMS Mathematics
Sparse and Compressive Sensing Techniques
1.33
article

An improved LS-RMIL-type conjugate gradient projection algorithm for systems of nonlinear equations and impulse noise image restoration

and Dandan Li, Xuejie Ma, Xia Yan
article en
1 citations

Abstract

This paper proposes an improved LS-RMIL-type conjugate gradient projection algorithm designed for solving systems of nonlinear equations with convex constraints. The algorithm introduces a search direction that maintains sufficient descent and trust-region properties independent of the line search approach. It operates under relatively mild conditions, requiring only continuity and monotonicity of nonlinear equations, thus avoiding the need for stronger assumptions such as Lipschitz continuity. The global convergence of the algorithm is established under these relaxed conditions. Furthermore, numerical experiments demonstrate that the algorithm exhibits superior efficiency and stability, particularly in solving large-scale nonlinear systems and in applications such as impulse noise image restoration, outperforming existing methods.

AIMS MathematicsVol. 10(6)
Guangzhou Automobile Group (China) (CN), Guangzhou Huashang College
Openalex Percentile: Top 22%
Sparse and Compressive Sensing Techniques
1.33
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.