A quadratically convergent O((k+1)root(n)L)-iteration algorithm for the P(k)-matrix linear complementarity problem.

Published in: Math. Program. (1995)

Keyphrases

linear complementarity problem
objective function
k means
np hard
dynamic programming
learning algorithm
computational complexity
linear programming
optimal solution
least squares
sufficient conditions
dynamical systems
convex hull
semidefinite programming
integer program