Globally convergent Jacobian-free nonlinear equation solvers based on non-monotone norm descent conditions and a modified line search technique

DOI10.1080/10556780903057192zbMath1198.90357OpenAlexW2070930326MaRDI QIDQ3161144

Shigeru Hanba

Publication date: 12 October 2010

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780903057192

zbMATH Keywords

global convergencenonlinear equationsderivative-free methodsmethods of quasi-Newton typemodified line search

Mathematics Subject Classification ID

Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56) Methods of quasi-Newton type (90C53)

Uses Software

• NEWUOA

Cites Work

• Unnamed Item
• Unnamed Item
• Linear and nonlinear iterative learning control
• Jacobian-free Newton-Krylov methods: a survey of approaches and applications.
• The “global” convergence of Broyden-like methods with suitable line search
• Quasi-Newton Methods, Motivation and Theory
• Convergence Theory of Nonlinear Newton–Krylov Algorithms
• Globally Convergent Inexact Newton Methods
• A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
• Trust Region Methods
• On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
• Iterative Solution of Nonlinear Equations in Several Variables
• An efficient method for finding the minimum of a function of several variables without calculating derivatives

This page was built for publication: Globally convergent Jacobian-free nonlinear equation solvers based on non-monotone norm descent conditions and a modified line search technique