Discover the SciOpen Platform and Achieve Your Research Goals with Ease.
Search articles, authors, keywords, DOl and etc.
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.
This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)
Comments on this article