Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions.
Renato D. C. MonteiroTakashi TsuchiyaPublished in: Math. Program. (1999)
Keyphrases
- interior point
- linear complementarity problem
- semidefinite
- primal dual
- linear programming
- semidefinite programming
- interior point methods
- convex optimization
- linear program
- variational inequalities
- linear programming problems
- nonnegative matrix factorization
- convergence rate
- approximation algorithms
- computationally intensive
- learning algorithm
- sufficient conditions
- image processing
- linear systems
- convex sets
- linear combination
- optimization problems
- special case