Login / Signup

A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints.

Jianzhong ZhangG. S. LiuS. Y. Wang
Published in: Numerische Mathematik (2004)
Keyphrases
  • globally convergent
  • linear constraints
  • search algorithm for solving
  • newton method
  • autocalibration
  • variational inequalities
  • line search
  • search algorithm
  • special case
  • sensitivity analysis
  • quadratic programming