A wide-neighborhood interior-point method for P*(κ) complementarity problem.
Yanli LvMingwang ZhangPublished in: IWACI (2010)
Keyphrases
- interior point methods
- convex optimization
- linear program
- primal dual
- linear programming
- semidefinite programming
- inequality constraints
- quadratic programming
- interior point algorithm
- solving problems
- computationally intensive
- cutting plane method
- linear programming problems
- coefficient matrix
- special case
- least squares