Pages that link to "Item:Q2273897"
From MaRDI portal
The following pages link to Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality (Q2273897):
Displayed 3 items.
- Semidefinite program duals for separable polynomial programs involving box constraints (Q1985290) (← links)
- A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints (Q2294373) (← links)
- Quadratically adjustable robust linear optimization with inexact data via generalized S-lemma: exact second-order cone program reformulations (Q6169993) (← links)