Pages that link to "Item:Q2574101"
From MaRDI portal
The following pages link to A new class of improved convex underestimators for twice continuously differentiable constrained NLPs (Q2574101):
Displayed 5 items.
- Global minimization of difference of quadratic and convex functions over box or binary constraints (Q928298) (← links)
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps (Q940828) (← links)
- Convex underestimation for posynomial functions of positive variables (Q941023) (← links)
- A new global optimization method for univariate constrained twice-differentiable NLP problems (Q946347) (← links)
- On the functional form of convex underestimators for twice continuously differentiable functions (Q2458918) (← links)
