Rates of convergence of a one-dimensional search based on interpolating polynomials
From MaRDI portal
Publication:1245151
DOI10.1007/BF00933226zbMath0373.90063MaRDI QIDQ1245151
Publication date: 1979
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Nonlinear programming (90C30) Search theory (90B40) Approximation by polynomials (41A10) Rate of convergence, degree of approximation (41A25)
Related Items (4)
A nonquadratic one dimensional interpolation method for optimization ⋮ A derivative-free bracketing scheme for univariate minimization ⋮ A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method ⋮ Measuring rates of convergence of numerical algorithms
Cites Work
- Line Search Techniques Based on Interpolating Polynomials using Function Values Only
- A Rapidly Convergent Descent Method for Minimization
- Function minimization by conjugate gradients
- Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
- On Differentiating Error Terms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Rates of convergence of a one-dimensional search based on interpolating polynomials
