Global minimization of univariate functions by sequential polynomial approximation

DOI10.1080/00207168908803738MaRDI QIDQ3831959zbMATH OpenOpenAlexFDO

Authors Pierre Hansen, Shi Hui Lu, Brigitte Jaumard

Publication date 1989

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207168908803738

zbMATH Keywords

active algorithmglobal minimizationpolynomial approximationsequential polynomial approximationunivariate optimization

Mathematics Subject Classification ID

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

Recommendations

• Globally minimizing polynomials without evaluating derivatives
• Search for global extremum of factorable univariate functions
• Simple global minimization algorithm for one-variable rational functions
• A one-dimensional deterministic global minimization algorithm
• An upper bound on the asymptotic complexity of global optimization of smooth univariate functions

Cites work

• A global minimization algorithm for a class of one-dimensional functions
• A Sequential Method Seeking the Global Maximum of a Function
• Bounds for an interval polynomial
• Function maximization
• Global optimization using interval analysis: The one-dimensional case
• Globally minimizing polynomials without evaluating derivatives
• scientific article; zbMATH DE number 3649911 (Why is no real title available?)
• scientific article; zbMATH DE number 3936378 (Why is no real title available?)
• scientific article; zbMATH DE number 3214550 (Why is no real title available?)
• scientific article; zbMATH DE number 3388498 (Why is no real title available?)
• Iterative Methods for the Localization of the Global Maximum
• Numerical methods for finding global extrema (Case of a non-uniform mesh)
• On optimal search strategies for the maximum of a function with bounded highest derivative
• Optimal passive algorithms for evaluating the maximum of a function in an interval
• Optimal strategies for seeking the global maximum of a function
• Optimal strategies of the search for an extremum
• The equality of errors in classes of passive and sequential algorithms
• The fastest exact algorithms for the isolation of the real roots of a polynomial equation
• The NP-completeness column: An ongoing guide
• The Range of Possible Values of f(x)

Cited in

(11)

• Unconstrained and constrained global optimization of polynomial functions in one variable
• Global optimization of univariate Lipschitz functions. I: Survey and properties
• Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison
• A semi-infinite programming method for approximating load duration curves by polynomials
• Cord-slope form of Taylor's expansion in univariate global optimization
• Search for global extremum of factorable univariate functions
• Simple global minimization algorithm for one-variable rational functions
• scientific article; zbMATH DE number 3844490 (Why is no real title available?)
• An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial
• Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
• Globally minimizing polynomials without evaluating derivatives

Describes a project that uses

Uses Software

• BRENT

This page was built for publication: Global minimization of univariate functions by sequential polynomial approximation

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