A full-Newton step non-interior continuation algorithm for a class of complementarity problems.

Jian-Xun Zhao Yong Wang

Published in: J. Comput. Appl. Math. (2012)

Keyphrases

learning algorithm
k means
np hard
dynamic programming
optimal solution
linear complementarity problem
complementarity problems
objective function
worst case
computational complexity
linear programming
expectation maximization
knapsack problem
semidefinite