-neighborhood infeasible interior-point algorithm for linear complementarity problems.
Mohammad PirhajiMaryam ZangiabadiHossein MansouriPublished in: 4OR (2017)
Keyphrases
- linear complementarity problem
- interior point algorithm
- interior point
- primal dual
- interior point methods
- linear programming
- variational inequalities
- convex optimization
- linear program
- semidefinite
- sufficient conditions
- semidefinite programming
- simplex method
- convergence rate
- multicriteria optimization
- search space
- quadratic programming
- lower bound
- approximation algorithms
- special case
- computationally intensive
- dynamic programming
- objective function
- solving problems
- column generation
- integer programming
- probability distribution
- np hard