Asymptotic Behavior of Underlying NT Paths in Interior Point Methods for Monotone Semidefinite Linear Complementarity Problems.
Chee-Khian SimPublished in: J. Optim. Theory Appl. (2011)
Keyphrases
- semidefinite
- linear complementarity problem
- interior point methods
- interior point
- semidefinite programming
- convex optimization
- linear programming
- linear program
- primal dual
- quadratic programming
- linear programming problems
- computationally intensive
- convex relaxation
- upper bound
- higher dimensional
- linear systems
- low rank
- multistage