A globally convergent method for solving nonlinear equations without the differentiability condition

DOI10.1007/BF02143127zbMath0860.65036OpenAlexW2089133473MaRDI QIDQ2564500

Alain Piétrus

Publication date: 21 April 1997

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

Full work available at URL: https://doi.org/10.1007/bf02143127

zbMATH Keywords

global convergenceiterative methodzeros of functionsmaximal real root

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items (2)

Always convergent methods for nonlinear equations of several variables ⋮ Always convergent iteration methods for nonlinear equations of Lipschitz functions

Cites Work

• Nondifferentiable optimization algorithm for designing control systems having singular value inequalities
• Globally convergent algorithm for solving nonlinear equations
• Rate of convergence of a generalization of Newton's method
• Local convergence analysis of tensor methods for nonlinear equations
• An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices
• Eigenvalue perturbations and nonlinear parametric optimization
• Structured and simultaneous Lyapunov functions for system stability problems

This page was built for publication: A globally convergent method for solving nonlinear equations without the differentiability condition