A globalization procedure for solving nonlinear systems of equations

DOI10.1007/BF02142807zbMath0861.65048MaRDI QIDQ1815701

Yixun Shi

Publication date: 18 November 1996

Published in: Numerical Algorithms (Search for Journal in Brave)

zbMATH Keywords

global convergencequasi-Newton methodshybrid Newton-steepest descent method

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10)

Related Items (7)

Discrete-time ZD, GD and NI for solving nonlinear time-varying equations ⋮ A global convergent derivative-free method for solving a system of non-linear equations ⋮ Combined Newton-gradient method for constrained root-finding in chemical reaction networks ⋮ Using gradient directions to get global convergence of Newton-type methods ⋮ Continuous and discrete time Zhang dynamics for time-varying 4th root finding ⋮ Globally convergent algorithms for solving unconstrained optimization problems ⋮ Practical quasi-Newton methods for solving nonlinear systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficent line search algorithm for unconstrained optimization
• Minimization of functions having Lipschitz continuous first partial derivatives
• A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
• The watchdog technique for forcing convergence in algorithms for constrained optimization
• A note on a sufficient-decrease criterion for a non-derivative step-length procedure
• Comparing Algorithms for Solving Sparse Nonlinear Systems of Equations
• Globally Convergent Inexact Newton Methods
• Convergence Conditions for Ascent Methods
• On Steepest Descent

This page was built for publication: A globalization procedure for solving nonlinear systems of equations