Login / Signup

A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems.

Joaquim JúdiceFernanda M. Pires
Published in: Comput. Oper. Res. (1994)
Keyphrases
  • computational complexity
  • np hard
  • dynamic programming
  • expectation maximization
  • convergence rate
  • linear complementarity problem
  • learning algorithm
  • objective function
  • worst case
  • convex hull
  • globally optimal