Optimization Online


The New Butterfly Relaxation Methods for Mathematical Program with Complementarity Constraints

Tangi Migot (tangi.migot***at***gmail.com)
Mounir Haddou (mounir.haddou***at***insa-rennes.fr)
Jean-Pierre Dussault (Jean-Pierre.Dussault***at***USherbrooke.CA)

Abstract: We propose a new family of relaxation schemes for mathematical program with complementarity constraints that extends the relaxations of Kadrani, Dussault, Bechakroun from 2009 and the one of Kanzow \& Schwartz from 2011. We discuss the properties of the sequence of relaxed non-linear program as well as stationarity properties of limiting points. A sub-family of our relaxation schemes has the desired property of converging to an M-stationary point. We introduce a new constraint qualification to prove convergence of our method, which is the weakest known constraint qualification that ensures boundedness of the sequence generated by the method. A comprehensive numerical comparison between existing relaxations methods is performed on the library of test problems MacMPEC and shows promising results for our new method. Numerical perspectives shows an enhanced version of the butterfly relaxation to mathematical program with vanishing constraints.

Keywords: nonlinear programming - MPCC - MPEC - relaxation methods - stationarity - constraint qualification - MPVC - CRSC

Category 1: Complementarity and Variational Inequalities

Category 2: Nonlinear Optimization (Constrained Nonlinear Optimization )

Citation: year : 2016

Download: [PDF]

Entry Submitted: 05/20/2017
Entry Accepted: 05/23/2017
Entry Last Modified: 10/01/2018

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 Optimization Society