The Chebyshev-Shamanskii method for solving systems of nonlinear equations
From MaRDI portal
Publication:1955568
DOI10.1007/s10957-012-0159-6zbMath1266.90174OpenAlexW1983925543MaRDI QIDQ1955568
Jean-Pierre Dussault, Bilel Kchouk
Publication date: 14 June 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0159-6
Related Items (3)
On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians ⋮ A simple and efficient method with high order convergence for solving systems of nonlinear equations ⋮ On the final steps of Newton and higher order methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- High-order Newton-penalty algorithms
- On iterative methods with accelerated convergence for solving systems of nonlinear equations
- On some one-point hybrid iterative methods
- The complexity of partial derivatives
- Implementation issues for high-order algorithms
- An improvement of the region of accessibility of Chebyshev’s method from Newton’s method
- On the Halley class of methods for unconstrainedoptimization problems
- Evaluating Derivatives
- On large-scale unconstrained optimization problems and higher order methods
- Testing Unconstrained Optimization Software
- A modification of the Chebyshev method
- Some Efficient Algorithms for Solving Systems of Nonlinear Equations
- A new family of high-order directions for unconstrained optimization inspired by Chebyshev and Shamanskii methods
- An acceleration of Newton's method: Super-Halley method
- Global convergence technique for the Newton method with periodic Hessian evaluation
This page was built for publication: The Chebyshev-Shamanskii method for solving systems of nonlinear equations
