A new unidimensional search method for optimization: linear interpolation method

DOI10.1016/j.amc.2005.01.098zbMath1090.65073OpenAlexW2070527826MaRDI QIDQ2490988

Emin Kahya

Publication date: 18 May 2006

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

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

zbMATH Keywords

performanceunconstrained optimizationnumerical examplestest functionsoptimization methodunidimensional search methodinitial interval of uncertaintylinear interpolation method

Mathematics Subject Classification ID

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

Related Items

A new robust line search technique based on Chebyshev polynomials, Modified secant-type methods for unconstrained optimization, On the convergence of inexact two-point Newton-like methods on Banach spaces, A modified secant method for unconstrained optimization, A class of exponential quadratically convergent iterative formulae for unconstrained optimization, On an iterative method for\cr unconstrained optimization

Cites Work

• On Fibonacci search method with \(k\)-Lucas numbers.
• An approach to nonlinear programming
• An Efficient One Dimensional Search Procedure
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item