Globally minimizing polynomials without evaluating derivatives
From MaRDI portal
Publication:3702410
DOI10.1080/00207168508803469zbMath0579.65061OpenAlexW2169316943MaRDI QIDQ3702410
Publication date: 1985
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207168508803469
Numerical mathematical programming methods (65K05) Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10)
Related Items
Simple global minimization algorithm for one-variable rational functions, New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems, A branch-and-reduce approach to global optimization, Unconstrained and constrained global optimization of polynomial functions in one variable, Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison, Global minimization of univariate functions by sequential polynomial approximation, Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions
Uses Software
Cites Work
