LP-based tractable subcones of the semidefinite plus nonnegative cone.
Akihiro TanakaAkiko YoshisePublished in: Ann. Oper. Res. (2018)
Keyphrases
- semidefinite
- linear programming
- semidefinite programming
- interior point
- interior point methods
- np hard
- linear program
- primal dual
- objective function
- positive semidefinite
- computational complexity
- complementarity problems
- optimal solution
- convex sets
- sufficient conditions
- nonnegative matrix factorization
- higher dimensional
- quadratic programming
- dynamic programming
- convex relaxation
- special case
- matrix factorization
- semi supervised
- training data