A rapid algorithm for a class of linear complementarity problems.

M. H. Xu G. F. Luan

Published in: Appl. Math. Comput. (2007)

Keyphrases

linear complementarity problem
dynamic programming
simulated annealing
learning algorithm
computational complexity
optimal solution
objective function
worst case
expectation maximization
convergence rate
k means
np hard
clustering method
data representation
interior point