Optimization Online


A robust SQP method for mathematical programs with linear complementarity constraints

Xinwei Liu (smaliuxw***at***nus.edu.sg)
Georgia Perakis (georgiap***at***mit.edu)
Jie Sun (jsun***at***nus.edu.sg)

Abstract: The relationship between the mathematical program with linear complementarity constraints (MPCC) and its inequality relaxation is studied. A new sequential quadratic programming (SQP) method is presented for solving the MPCC based on this relationship. A certain SQP technique is introduced to deal with the possible infeasibility of quadratic programming subproblems. Global convergence results are derived without assuming the linear independence constraint qualification for MPEC and nondegeneracy of the complementarity constraints. Preliminary numerical results are reported.

Keywords: mathematical programs with equilibrium constraints, sequential quadratic programming, complementarity, constraint qualification, nondegeneracy

Category 1: Complementarity and Variational Inequalities

Citation: Research report, Singapore-MIT Alliance, National University of Singapore, 2003.

Download: [Postscript][PDF]

Entry Submitted: 09/27/2003
Entry Accepted: 09/29/2003
Entry Last Modified: 10/23/2003

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