A generalized Newton algorithm using higher-order derivatives
From MaRDI portal
Publication:1162119
DOI10.1007/BF00934601zbMath0479.65040MaRDI QIDQ1162119
Robert E. Kalaba, Asher Tishler
Publication date: 1983
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Related Items (11)
On the Halley class of methods for unconstrainedoptimization problems ⋮ A simple algorithm for high order Newton iteration formulae and some new variants ⋮ On the use of higher order derivatives in optimization using Lagrange's expansion ⋮ Theoretical efficiency of a new inexact method of tangent hyperbolas ⋮ Theoretical efficiency of a new inexact method of tangent hyperbolas ⋮ Automatic differentiation: Reduced gradient and reduced Hessian matrix ⋮ A computer program to minimize a function with many variables using computer evaluated exact higher-order derivatives ⋮ Generalized Newton algorithm to minimize a function with many variables using computer-evaluated exact higher-order derivatives ⋮ On the use of the table method in constrained optimization ⋮ Rate of convergence of the generalized Newton algorithm using the fixed- point approach ⋮ The polyadic structure of factorable function tensors with applications to high-order minimization techniques
Cites Work
- Unnamed Item
- Unnamed Item
- Nonlinear least squares via automatic derivative evaluation
- On the efficient computation of the nonlinear full-information maximum- likelihood estimator
- Two new unconstrained optimization algorithms which use function and gradient values
- Quasi-Newton Methods, Motivation and Theory
- A simple automatic derivative evaluation program
- Wengert's numerical method for partial derivatives, orbit determination and quasilinearization
This page was built for publication: A generalized Newton algorithm using higher-order derivatives
