A Class of Polynomial Interior Point Algorithms for the Cartesian P-Matrix Linear Complementarity Problem over Symmetric Cones.
Guo-Qiang WangYan-Qin BaiPublished in: J. Optim. Theory Appl. (2012)
Keyphrases
- linear complementarity problem
- interior point
- linear programming
- interior point methods
- linear program
- convex optimization
- semidefinite programming
- semidefinite
- nonnegative matrix factorization
- primal dual
- complementarity problems
- linear programming problems
- sufficient conditions
- linear systems
- dynamic programming
- learning algorithm
- column generation
- feasible solution
- quadratic programming
- optimization problems
- least squares
- computational complexity