Login / Signup
An algorithm for the fast solution of symmetric linear complementarity problems.
José Luis Morales
Jorge Nocedal
Mikhail Smelyanskiy
Published in:
Numerische Mathematik (2008)
Keyphrases
</>
linear complementarity problem
optimal solution
learning algorithm
computational complexity
dynamic programming
linear programming
optimization method
convergence rate
lower bound
k means
multi objective
np hard
least squares
worst case
sensitivity analysis
nonnegative matrix factorization