Pages that link to "Item:Q2294373"
From MaRDI portal
The following pages link to A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints (Q2294373):
Displaying 4 items.
- Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization (Q280088) (← links)
- Semidefinite program duals for separable polynomial programs involving box constraints (Q1985290) (← links)
- Sum-of-squares relaxations in robust DC optimization and feature selection (Q6142071) (← links)
- Quadratically adjustable robust linear optimization with inexact data via generalized S-lemma: exact second-order cone program reformulations (Q6169993) (← links)
