A New Polynomial Interior-Point Algorithm for the Monotone Linear complementarity Problem over Symmetric cones with Full NT-Steps.
G. Q. WangPublished in: Asia Pac. J. Oper. Res. (2012)
Keyphrases
- linear complementarity problem
- interior point algorithm
- interior point
- primal dual
- interior point methods
- linear programming
- variational inequalities
- convex optimization
- sufficient conditions
- semidefinite
- linear program
- semidefinite programming
- complementarity problems
- simplex method
- convergence rate
- multicriteria optimization
- np hard
- upper bound
- dynamic programming
- solving problems
- column generation
- approximation algorithms
- quadratic program