Login / Signup

Subspace Accelerated Matrix Splitting Algorithms for Asymmetric and Symmetric Linear Complementarity Problems.

Daniel P. RobinsonLiming FengJorge NocedalJong-Shi Pang
Published in: SIAM J. Optim. (2013)
Keyphrases
  • linear complementarity problem
  • interior point
  • computational complexity
  • dynamic programming
  • convex optimization
  • variational inequalities
  • denoising
  • high dimensional data
  • sensitivity analysis