Sign in

A computational study for bilevel quadratic programs using semidefinite relaxations.

Pablo AdasmeAbdel Lisser
Published in: Eur. J. Oper. Res. (2016)
Keyphrases
  • semidefinite
  • linear programming
  • semidefinite programming
  • convex relaxation
  • feature selection
  • bayesian networks
  • lower bound
  • graph cuts
  • sufficient conditions
  • quadratic program