Nonoptimal termination properties of quadratic interpolation univariate searches

DOI10.1016/0016-0032(78)90034-0zbMath0385.90097OpenAlexW2022583866MaRDI QIDQ1249520

M. A. Townsend, Glenn Eric Johnson

Publication date: 1978

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(78)90034-0

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Search theory (90B40)

Related Items (3)

An efficient interfacing of golden-section and quadratic searches ⋮ A generalized direct search acceptable-point technique for use with descent-type multivariate algorithms ⋮ In favor of conjugate directions: a generalized acceptable-point algorithm for function minimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimization of functions having Lipschitz continuous first partial derivatives
• Comparison of some conjugate direction procedures for function minimization
• Quasi-Newton Methods, Motivation and Theory
• A Class of Methods for Solving Nonlinear Simultaneous Equations
• A Rapidly Convergent Descent Method for Minimization
• Function minimization by conjugate gradients
• An efficient method for finding the minimum of a function of several variables without calculating derivatives
• A new approach to variable metric algorithms
• On Steepest Descent
• Efficient Implementations of the Polak–Ribière Conjugate Gradient Algorithm

This page was built for publication: Nonoptimal termination properties of quadratic interpolation univariate searches