Login / Signup

Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming.

Roberto AndreaniGabriel HaeserLeonardo M. MitoH. RamírezDaiana O. SantosPaulo Silveira
Published in: Optim. Lett. (2022)
Keyphrases
  • semidefinite programming
  • interior point methods
  • linear programming
  • semidefinite
  • primal dual
  • kernel matrix
  • positive semidefinite
  • maximum margin
  • special case
  • graphical models
  • convex optimization