Unidimensional curve fitting search schemes revisited for multidimensional optimization algorithms

DOI10.1016/0045-7906(84)90014-4MaRDI QIDQ1064742zbMATH OpenOpenAlexFDO

Authors B. George

Publication date 1984

Published in Computers and Electrical Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0045-7906(84)90014-4

zbMATH Keywords

cubic interpolationlinesearch algorithmsn-dimensional optimizationquadratic fit

Mathematics Subject Classification ID

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

Review text

Many approaches to n-dimensional optimization require a subroutine for 1- dimensional minimization. This paper proposes 2 new linesearch algorithms (to be used in the context of n-dimensional optimization) and compares them, experimentally, to the quadratic fit and cubic interpolation methods.

Recommendations

• One-dimensional simplex search
• Line search by curve fitting in minimization algorithms
• Extended univariate algorithms for n-dimensional global optimization
• A new unidimensional search method for optimization: linear interpolation method
• A multi-step curve search algorithm in nonlinear optimization

Cited in

(6)

• Extended univariate algorithms for n-dimensional global optimization
• Multidimensional curve fitting to unorganized data points by nonlinear minimization
• A new unidimensional search method for optimization: linear interpolation method
• scientific article; zbMATH DE number 1728407 (Why is no real title available?)
• A novel global optimization technique for high dimensional functions
• Optimization in ℝⁿby Coggin's method

This page was built for publication: Unidimensional curve fitting search schemes revisited for multidimensional optimization algorithms

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