Pages that link to "Item:Q1310976"
From MaRDI portal
The following pages link to Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions (Q1310976):
Displaying 6 items.
- Comparison between Baumann and admissible simplex forms in interval analysis (Q995937) (← links)
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems (Q1371947) (← links)
- A new two-level linear relaxed bound method for geometric programming problems (Q1774846) (← links)
- A branch-and-reduce approach to global optimization (Q1924068) (← links)
- An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial (Q3627691) (← links)
- Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint (Q3635703) (← links)
