A nonquadratic one dimensional interpolation method for optimization
From MaRDI portal
Recommendations
Cites work
- A conjugate-direction method based on a nonquadratic model
- An iterative method for algebraic equation by Padé approximation
- Analysis of a new algorithm for one-dimensional minimization
- Conic Approximations and Collinear Scalings for Optimizers
- scientific article; zbMATH DE number 3635377 (Why is no real title available?)
- scientific article; zbMATH DE number 3258269 (Why is no real title available?)
- scientific article; zbMATH DE number 3382096 (Why is no real title available?)
- Interpolation methods in one dimensional optimization
- Rates of convergence of a one-dimensional search based on interpolating polynomials
- Recurrence relations for rational cubic methods. I: The Halley method
- Recurrence relations for rational cubic methods. II: The Chebyshev method
- Use of a nonquadratic model in a conjugate-gradient method of optimization with inexact line searches, unconstrained minimization
Cited in
(7)- A new unidimensional search method for optimization: linear interpolation method
- Comonotone parametric C^ 1 interpolation of nongridded data
- scientific article; zbMATH DE number 4074374 (Why is no real title available?)
- scientific article; zbMATH DE number 1941952 (Why is no real title available?)
- Quadratic interpolation algorithm for minimizing tabulated function
- A rapidly convergence algorithm for linear search and application
- Scaled one-step methods with one interpolation point
This page was built for publication: A nonquadratic one dimensional interpolation method for optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4323407)
