Implementation issues for high-order algorithms

zbMATH Open1182.65215MaRDI QIDQ2390723FDOQ2390723

Benoit Hamelin, Jean-Pierre Dussault, Bilel Kchouk

Publication date: 3 August 2009

Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)

Recommendations

• High-order Newton-penalty algorithms
• On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians
• A simple algorithm for high order Newton iteration formulae and some new variants
• On the Halley class of methods for unconstrained optimization problems
• Computational pitfalls of high-order methods for nonlinear equations

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20)

Cited In (3)

• On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians
• High-order Newton-penalty algorithms
• The Chebyshev-Shamanskii method for solving systems of nonlinear equations

Uses Software

• Scilab

This page was built for publication: Implementation issues for high-order algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390723)