A fast symmetric penalty algorithm for the linear complementarity problem.

Peter A. Beling Sushil Verma

Published in: SMC (1998)

Keyphrases

learning algorithm
linear complementarity problem
objective function
optimal solution
k means
computational complexity
worst case
linear programming
dynamic programming
expectation maximization
sufficient conditions
convex hull
knapsack problem
computationally intensive
decomposition algorithm