Parameterized Complexity of Sparse Linear Complementarity Problems.
Hanna SumitaNaonori KakimuraKazuhisa MakinoPublished in: IPEC (2015)
Keyphrases
- linear complementarity problem
- parameterized complexity
- sufficient conditions
- fixed parameter tractable
- variational inequalities
- interior point
- global constraints
- semidefinite
- high dimensional
- sparse representation
- computational problems
- np complete
- convex relaxation
- linear programming
- machine learning
- principal component analysis
- dynamic programming