Rates of convergence of a one-dimensional search based on interpolating polynomials

DOI10.1007/BF00933226MaRDI QIDQ1245151zbMATH OpenFDO

Authors K. Appert

Publication date 1979

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00933226

Mathematics Subject Classification ID

Approximation by polynomials (41A10) Rate of convergence, degree of approximation (41A25) Search theory (90B40) Nonlinear programming (90C30)

Cites work

• A Rapidly Convergent Descent Method for Minimization
• Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
• Function minimization by conjugate gradients
• scientific article; zbMATH DE number 3466802 (Why is no real title available?)
• scientific article; zbMATH DE number 3352737 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• scientific article; zbMATH DE number 3195683 (Why is no real title available?)
• Line Search Techniques Based on Interpolating Polynomials using Function Values Only
• On Differentiating Error Terms

Cited in

(4)

• Measuring rates of convergence of numerical algorithms
• A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method
• A nonquadratic one dimensional interpolation method for optimization
• A derivative-free bracketing scheme for univariate minimization

This page was built for publication: Rates of convergence of a one-dimensional search based on interpolating polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1245151)