Login / Signup

Finding Sparse Solutions for Packing and Covering Semidefinite Programs.

Khaled M. ElbassioniKazuhisa MakinoWaleed Najy
Published in: SIAM J. Optim. (2022)
Keyphrases
  • semidefinite
  • semidefinite programming
  • high dimensional
  • sufficient conditions
  • convex relaxation
  • interior point methods
  • genetic algorithm
  • optimal solution
  • lower bound
  • multistage
  • shape analysis
  • convex sets