A new class of root-finding methods in \({\mathbb {R}}^n\): the inexact tensor-free Chebyshev-Halley class

DOI10.1007/s40314-018-0709-0zbMath1424.65082OpenAlexW2889025175MaRDI QIDQ1715715

Rodrigo G. Eustaquio, Miguel A. Dumett, Ademir Alves Ribeiro

Publication date: 29 January 2019

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

Full work available at URL: https://doi.org/10.1007/s40314-018-0709-0

zbMATH Keywords

convergence ratesnonlinear systemsinexact Chebyshev-Halley classtensor-free

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10)

Uses Software

• TENSOLVE
• TensorToolbox
• Algorithm 862

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tensor Decompositions and Applications
• On diagonally structured problems in unconstrained optimization using an inexact super Halley method
• Convergence of the variants of the Chebyshev-Halley iteration family under the Hölder condition of the first derivative
• On the local convergence of a family of Euler-halley type iterations with a parameter
• Avoiding the computation of the second Fréchet-derivative in the convex acceleration of Newton's method
• The Jarratt method in Banach space setting
• Jacobian-free Newton-Krylov methods: a survey of approaches and applications.
• Second-derivative-free variant of the Chebyshev method for nonlinear equations
• Globally convergent variable metric method for convex nonsmooth unconstrained minimization
• Rate of convergence of higher-order methods
• Convergence of the family of the deformed Euler--Halley iterations under the Hölder condition of the second derivative
• A Globally Convergent Newton-GMRES Subspace Method for Systems of Nonlinear Equations
• Finding the Zeros of a Univariate Equation: Proxy Rootfinders, Chebyshev Interpolation, and the Companion Matrix
• Hybrid Krylov Methods for Nonlinear Systems of Equations
• On the Performance of Tensor Methods for Solving Ill-Conditioned Problems
• Algorithm 862
• On large-scale unconstrained optimization problems and higher order methods
• Efficient MATLAB Computations with Sparse and Factored Tensors
• Tensor Methods for Nonlinear Equations
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Inexact Newton Methods
• Discretized Euler–Chebyshev Multistep Methods
• A family of Chebyshev-Halley type methods in Banach spaces
• Algorithm 755: ADOL-C
• Algorithm 768: TENSOLVE
• A Multilinear Singular Value Decomposition
• Choosing the Forcing Terms in an Inexact Newton Method
• Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
• A Filter-Trust-Region Method for Unconstrained Optimization
• Tensor-Krylov Methods for Solving Large-Scale Systems of Nonlinear Equations
• An acceleration of Newton's method: Super-Halley method
• Benchmarking optimization software with performance profiles.

This page was built for publication: A new class of root-finding methods in \({\mathbb {R}}^n\): the inexact tensor-free Chebyshev-Halley class