Abstract
A family of algorithms which solve the complementarity problem (and certain generalized complementarity problems) is introduced. In these algorithms block pivots (multiple exchanges of basic and nonbasic variables) are permitted. The geometry of complementarity points is studied. The proof that these algorithms converge in a finite number of steps is based on certain elementary results from group theory, and does not rely on monotonicity arguments.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
