Pages that link to "Item:Q3702410"
From MaRDI portal
The following pages link to Globally minimizing polynomials without evaluating derivatives (Q3702410):
Displayed 7 items.
- Unconstrained and constrained global optimization of polynomial functions in one variable (Q1187372) (← links)
- Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison (Q1198733) (← links)
- Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions (Q1310976) (← links)
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems (Q1371947) (← links)
- Simple global minimization algorithm for one-variable rational functions (Q1892608) (← links)
- A branch-and-reduce approach to global optimization (Q1924068) (← links)
- Global minimization of univariate functions by sequential polynomial approximation (Q3831959) (← links)