Global minimization of univariate functions by sequential polynomial approximation
From MaRDI portal
Publication:3831959
DOI10.1080/00207168908803738zbMath0676.65063OpenAlexW1966730842MaRDI QIDQ3831959
Shi Hui Lu, Brigitte Jaumard, Pierre Hansen
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
polynomial approximationglobal minimizationunivariate optimizationactive algorithmsequential polynomial approximation
Related Items
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, 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, Cord-slope form of Taylor's expansion in univariate global optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The fastest exact algorithms for the isolation of the real roots of a polynomial equation
- Bounds for an interval polynomial
- A global minimization algorithm for a class of one-dimensional functions
- Global optimization using interval analysis: The one-dimensional case
- On optimal search strategies for the maximum of a function with bounded highest derivative
- Globally minimizing polynomials without evaluating derivatives
- The equality of errors in classes of passive and sequential algorithms
- Iterative Methods for the Localization of the Global Maximum
- Function maximization
- Optimal passive algorithms for evaluating the maximum of a function in an interval
- Optimal strategies for seeking the global maximum of a function
- The Range of Possible Values of f(x)
- A Sequential Method Seeking the Global Maximum of a Function
- Optimal strategies of the search for an extremum
- Numerical methods for finding global extrema (Case of a non-uniform mesh)
- The NP-completeness column: An ongoing guide