A variant method for solving system of nonlinear equations is presented. This method use the special form of iteration with two step length parameters, we suggest a derivative-free method without computing the Jacobian via acceleration parameter as well as inexact line search procedure. The proposed method is proven to be globally convergent under mild condition. The preliminary numerical comparison reported in this paper using a large scale benchmark test problems show that the proposed method is practically quite effective.
One of the fastest, old, and most adopted method for solving unconstrained optimization problems is the conjugate gradient method (cg). Over the decades, several types of research have been put in place to extend the methods (cg) to solving constrained monotone nonlinear equations. This paper presents a scaled three-term cg for convex-constrained monotone nonlinear equations. The proposed method fulfills descent (sufficient) property as well as trust-region feature. Two sets of numerical experiments were carried off and demonstrate the effectiveness of the proposed method by comparison with existing methods in the literature. In the first experiment, the proposed method was applied and solved some convex-constrained monotone nonlinear equations using some benchmark test functions. For the second experiment, a signal problem; that arose from compressed sensing was restored by applying the proposed method.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.