Worst-case evaluation complexity of derivative-free nonmonotone line search methods for solving nonlinear systems of equations

DOI10.1007/s40314-021-01621-4zbMath1476.65074OpenAlexW3204762462MaRDI QIDQ2052297

Flávia Chorobura, Geovani Nunes Grapiglia

Publication date: 25 November 2021

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-021-01621-4

zbMATH Keywords

global convergencenonmonotone line searchworst-case complexitynonlinear systems of equations

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Complexity and performance of numerical algorithms (65Y20)

Uses Software

• minpack
• BB

Cites Work

• A parallel Jacobian-free Newton-Krylov solver for a coupled sea ice-ocean model
• On a global complexity bound of the Levenberg-marquardt method
• Jacobian-free Newton-Krylov methods: a survey of approaches and applications.
• Global complexity bound of the inexact Levenberg-Marquardt method
• A spectral algorithm for large-scale systems of nonlinear monotone equations
• On the worst-case evaluation complexity of non-monotone line search algorithms
• A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares
• On the resolution of monotone complementarity problems
• A derivative-free trust-region algorithm for composite nonsmooth optimization
• Convergence and complexity analysis of a Levenberg-Marquardt algorithm for inverse problems
• A Jacobian-free approximate Newton-Krylov startup strategy for RANS simulations
• Algebraic rules for computing the regularization parameter of the Levenberg-Marquardt method
• Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case
• Global complexity bound of the Levenberg–Marquardt method
• On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming
• Testing Unconstrained Optimization Software
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems
• A Nonmonotone Line Search Technique for Newton’s Method
• Benchmarking Derivative-Free Optimization Algorithms
• A derivative-free nonmonotone line search and its application to the spectral residual method
• Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
• Unnamed Item
• Unnamed Item

This page was built for publication: Worst-case evaluation complexity of derivative-free nonmonotone line search methods for solving nonlinear systems of equations