Polynomial time solvability of non-symmetric semidefinite programming.
Sheng-Long HuZheng-Hai HuangPublished in: Oper. Res. Lett. (2010)
Keyphrases
- semidefinite programming
- symmetric matrix
- linear matrix inequality
- linear programming
- semidefinite
- interior point methods
- kernel matrix
- special case
- primal dual
- computational complexity
- worst case
- maximum margin
- algorithm for linear programming
- positive semidefinite
- metric learning
- pattern classification
- linear program
- model selection
- high dimensional
- learning algorithm