A generalized Newton algorithm using higher-order derivatives
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3325981 (Why is no real title available?)
- scientific article; zbMATH DE number 3366405 (Why is no real title available?)
- A simple automatic derivative evaluation program
- Nonlinear least squares via automatic derivative evaluation
- On the efficient computation of the nonlinear full-information maximum- likelihood estimator
- Quasi-Newton Methods, Motivation and Theory
- Two new unconstrained optimization algorithms which use function and gradient values
- Wengert's numerical method for partial derivatives, orbit determination and quasilinearization
Cited in
(11)- Theoretical efficiency of a new inexact method of tangent hyperbolas
- Theoretical efficiency of a new inexact method of tangent hyperbolas
- A simple algorithm for high order Newton iteration formulae and some new variants
- On the Halley class of methods for unconstrained optimization problems
- On the use of higher order derivatives in optimization using Lagrange's expansion
- On the use of the table method in constrained optimization
- Rate of convergence of the generalized Newton algorithm using the fixed- point approach
- 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
- Automatic differentiation: Reduced gradient and reduced Hessian matrix
- The polyadic structure of factorable function tensors with applications to high-order minimization techniques
This page was built for publication: A generalized Newton algorithm using higher-order derivatives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1162119)
