Pages that link to "Item:Q2365380"

The following pages link to Numerical experience with Newton-like methods for nonlinear algebraic systems (Q2365380):

Displaying 16 items.

• Dai-Kou type conjugate gradient methods with a line search only using gradient (Q522525) (← links)
• A nonmonotone Jacobian smoothing inexact Newton method for NCP (Q523575) (← links)
• Smoothing Levenberg-Marquardt method for general nonlinear complementarity problems under local error bound (Q534917) (← links)
• Practical quasi-Newton algorithms for singular nonlinear systems (Q607523) (← links)
• A Levenberg-Marquardt method for nonlinear complementarity problems based on nonmonotone trust region and line search techniques (Q723833) (← links)
• Globally convergent Jacobian smoothing inexact Newton methods for NCP (Q1029625) (← links)
• Some modifications of Newton's method for solving systems of equations (Q1717126) (← links)
• A numerical study on large-scale nonlinear solvers (Q1816666) (← links)
• On the order of convergence of Broyden's method. Faster convergence on mixed linear-nonlinear systems of equations and a conjecture on the q-order (Q2059719) (← links)
• A new class of neural networks for NCPs using smooth perturbations of the natural residual function (Q2075986) (← links)
• A multi-iterate method to solve systems of nonlinear equations (Q2370325) (← links)
• A globally convergent hybrid conjugate gradient method and its numerical behaviors (Q2375413) (← links)
• Jacobian smoothing Brown's method for NCP (Q2518106) (← links)
• Solving polynomial systems using a fast adaptive back propagation-type neural network algorithm (Q4575282) (← links)
• A new smoothing quasi-Newton method for nonlinear complementarity problems (Q5920465) (← links)
• On the final steps of Newton and higher order methods (Q5963239) (← links)