Optimization Online


The Linear Complementarity Problem, Lemke Algorithm, Perturbation, and the Complexity Class PPAD

Ilan Adler(adler***at***ieor.berkeley.edu)
Sushil Verma(sushil.verma***at***enumerica.com)

Abstract: We present a single sufficient condition for the processability of the Lemke algorithm for semimonotone Linear Complementarity problems (LCP) which unifies several sufficient conditions for a number of well known subclasses of semimonotone LCPs. In particular, we study the close relationship of these problems to the complexity class PPAD. Next, we show that these classes of LCPs can be reduced (polynomially), by perturbation, to stricter sub-classes and establish an alternative (non-combinatorial) scheme to prove their membership in PPAD. We then identify several of these subclasses as PPAD-complete and discuss the likelihood that the other subclasses (all of which are reducible to LCP's with P matrices) are PPAD-complete. Finally, we present an hierarchy of subclasses of the semimonotone LCP's within the complexity classes of P, PPAD and NP-complete.

Keywords: Linear Complementarity Prpblem (LCP), Semimonotone, PPAD, Perturbation, Lemke Algorithm

Category 1: Complementarity and Variational Inequalities

Citation: Manuscript, Depatrment of IEOR, University of California, Berkeley, CA 94720, February/2011

Download: [PDF]

Entry Submitted: 03/01/2011
Entry Accepted: 03/01/2011
Entry Last Modified: 03/01/2011

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society