A modified secant method for unconstrained optimization
From MaRDI portal
Recommendations
- Modified secant-type methods for unconstrained optimization
- A new secant-type method for univariate unconstrained optimization
- A class of modified secant methods for unconstrained optimization
- A second-derivative-free modified secant-like method with order 2.732\dots\ for unconstrained optimization
- A new modified BFGS method for unconstrained optimization problems
Cites work
- A Modified BFGS Algorithm for Unconstrained Optimization
- A Newton-type univariate optimization algorithm for locating the nearest extremum
- A new unidimensional search method for optimization: linear interpolation method
- A variant of Newton's method with accelerated third-order convergence
- An approach to nonlinear programming
- Modified secant-type methods for unconstrained optimization
- On modified Newton methods with cubic convergence
- On some third-order iterative methods for solving nonlinear equations
- Some new variants of Newton's method.
- Some variant of Newton's method with third-order convergence.
Cited in
(8)- A new secant-type method for univariate unconstrained optimization
- scientific article; zbMATH DE number 640536 (Why is no real title available?)
- Cubic overestimation and secant updating for unconstrained optimization of \(C^{2,1}\) functions
- Modified secant-type methods for unconstrained optimization
- A class of modified secant methods for unconstrained optimization
- On an iterative method for unconstrained optimization
- scientific article; zbMATH DE number 783979 (Why is no real title available?)
- A second-derivative-free modified secant-like method with order 2.732\dots\ for unconstrained optimization
This page was built for publication: A modified secant method for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q884544)
