Login / Signup
Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem.
Chee-Khian Sim
Gongyun Zhao
Published in:
Math. Program. (2007)
Keyphrases
</>
linear complementarity problem
semidefinite
interior point methods
interior point
semidefinite programming
convex optimization
linear programming
linear program
primal dual
quadratic programming
computationally intensive
linear programming problems
solving problems
upper bound
sufficient conditions
linear systems
convex relaxation
optimal solution