A modified secant method for unconstrained optimization

DOI10.1016/j.amc.2006.08.042zbMath1117.65089OpenAlexW2071884615MaRDI QIDQ884544

Emin Kahya, Jinhai Chen

Publication date: 6 June 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.08.042

zbMATH Keywords

unconstrained optimizationnumerical examplessecant methodtest functionsunivariate optimization

Mathematics Subject Classification ID

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

Related Items (3)

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 ⋮ On an iterative method for\cr unconstrained optimization

Cites Work

• On some third-order iterative methods for solving nonlinear equations
• Modified secant-type methods for unconstrained optimization
• A Newton-type univariate optimization algorithm for locating the nearest extremum
• Some variant of Newton's method with third-order convergence.
• Some new variants of Newton's method.
• A new unidimensional search method for optimization: linear interpolation method
• On modified Newton methods with cubic convergence
• An approach to nonlinear programming
• A Modified BFGS Algorithm for Unconstrained Optimization
• A variant of Newton's method with accelerated third-order convergence

This page was built for publication: A modified secant method for unconstrained optimization