Login / Signup

A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints.

N. H. ChieuThai Doan ChuongV. JeyakumarGuoyin Li
Published in: Oper. Res. Lett. (2019)
Keyphrases
  • quadratic optimization
  • interior point methods
  • semidefinite
  • non binary
  • quadratically constrained quadratic
  • linear programming
  • data mining
  • np hard
  • semidefinite programming