An interior-point algorithm for horizontal linear complementarity problems.
Soodabeh AsadiHossein MansouriMaryam ZangiabadiPublished in: Int. J. Math. Oper. Res. (2018)
Keyphrases
- interior point algorithm
- linear complementarity problem
- interior point
- primal dual
- interior point methods
- linear programming
- variational inequalities
- convex optimization
- linear program
- semidefinite
- semidefinite programming
- sufficient conditions
- convergence rate
- simplex method
- quadratic programming
- approximation algorithms
- column generation
- multicriteria optimization
- np hard
- computationally intensive
- dynamic programming
- image processing
- solving problems
- quadratic program
- dynamical systems
- linear combination