We present a superlinearly convergent method to solve a constrained system of nonlinear equations. The proposed procedure is an adaptation of the linear-programming-Newton method replacing the first-order information with a… Click to show full abstract
We present a superlinearly convergent method to solve a constrained system of nonlinear equations. The proposed procedure is an adaptation of the linear-programming-Newton method replacing the first-order information with a secant update. Thus, under mild assumptions, the method is able to find possible nonisolated solutions without computing any derivative and achieving a local superlinear rate of convergence. In addition to the convergence analysis, some numerical examples are presented in order to show the fulfillment of the expected rate of convergence.
               
Click one of the above tabs to view related content.