A robust sequential quadratic programming method for mathematical programs with linear complementarity constraints

A robust sequential quadratic programming method for mathematical programs with linear complementarity constraints

0.00 Avg rating0 Votes
Article ID: iaor2007447
Country: Netherlands
Volume: 34
Issue: 1
Start Page Number: 5
End Page Number: 33
Publication Date: May 2006
Journal: Computational Optimization and Applications
Authors: , ,
Keywords: complementarity
Abstract:

The relationship between the mathematical program with linear complementarity constraints (MPLCC) and its inequality relaxation is studied. Based on this relationship, a new sequential quadratic programming (SQP) method is presented for solving the MPLCC. 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, the nondegeneracy condition, and any feasibility condition of the quadratic programming subproblems. Preliminary numerical results are reported.

Reviews

Required fields are marked *. Your email address will not be published.