A new family of high-order directions for unconstrained optimization inspired by Chebyshev and Shamanskii methods

DOI10.1080/10556788.2012.732074zbMath1282.90178OpenAlexW2152778795MaRDI QIDQ5746685

Jean-Pierre Dussault, Bilel Kchouk

Publication date: 7 February 2014

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

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

zbMATH Keywords

unconstrained optimizationChebyshev methodautomatic differentiationNewton methodShamanskii method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (2)

On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians ⋮ The Chebyshev-Shamanskii method for solving systems of nonlinear equations

Uses Software

• KELLEY
• minpack

Cites Work

• 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
• The complexity of partial derivatives
• 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 Modified Cholesky Algorithm Based on a Symmetric Indefinite Factorization
• Numerical Optimization
• Optimal Order of One-Point and Multipoint Iteration
• The Kantorovich Theorem for Newton's Method
• Some Efficient Algorithms for Solving Systems of Nonlinear Equations
• Global convergence technique for the Newton method with periodic Hessian evaluation

This page was built for publication: A new family of high-order directions for unconstrained optimization inspired by Chebyshev and Shamanskii methods