Modified secant-type methods for unconstrained optimization

DOI10.1016/j.amc.2006.03.003zbMath1105.65058OpenAlexW2008249171MaRDI QIDQ856130

Emin Kahya

Publication date: 7 December 2006

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

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

zbMATH Keywords

numerical examplesNewton methodsecant methodunivariate optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53) Numerical computation of solutions to single equations (65H05)

Related Items (8)

A class of modified secant methods for unconstrained optimization ⋮ A new robust line search technique based on Chebyshev polynomials ⋮ A modified secant method for unconstrained optimization ⋮ A class of exponential quadratically convergent iterative formulae for unconstrained optimization ⋮ A second-derivative-free modified secant-like method with order 2.732\dots\ for unconstrained optimization ⋮ New BFGS method for unconstrained optimization problem based on modified Armijo line search ⋮ On an iterative method for\cr unconstrained optimization ⋮ Rapidly convergent Steffensen-based methods for unconstrained optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new unidimensional search method for optimization: the 5/9 method
• On some third-order iterative methods for solving nonlinear equations
• A Newton-type univariate optimization algorithm for locating the nearest extremum
• On Fibonacci search method with \(k\)-Lucas numbers.
• Some variant of Newton's method with third-order convergence.
• On Newton-type methods with cubic convergence
• A new unidimensional search method for optimization: linear interpolation method
• On modified Newton methods with cubic convergence
• An approach to nonlinear programming

This page was built for publication: Modified secant-type methods for unconstrained optimization