Mathematical Programs with Vanishing Constraints: Constraint Qualifications, their Applications and a New Regularization Method - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Optimization Année : 2019

Mathematical Programs with Vanishing Constraints: Constraint Qualifications, their Applications and a New Regularization Method

Résumé

We propose a new family of relaxation schemes for mathematical programs with vanishing constraints that extend the relaxation of Hoheisel, Kanzow & Schwartz from 2012. We discuss the properties of the sequence of relaxed non-linear programs as well as stationary properties of limiting points. Our relaxation schemes have the desired property of converging to an M-stationary point. We obtain the new MPVC-wGCQ and prove that it is the weakest constraint qualification for MPVC. We also introduce a new constraint qualification, MPVC-CRSC, that is sufficient to guarantee the convergence of the new method. Under this weak condition, we also provide an error bound and an exact penalty result for the MPVC.
Fichier principal
Vignette du fichier
RelaxMPVC_hal.pdf (441.4 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01701461 , version 1 (05-02-2018)
hal-01701461 , version 2 (16-12-2019)

Identifiants

Citer

Jean-Pierre Dussault, Mounir Haddou, Tangi Migot. Mathematical Programs with Vanishing Constraints: Constraint Qualifications, their Applications and a New Regularization Method. Optimization, 2019, 68 (2-3), pp.509-538. ⟨10.1080/02331934.2018.1542531⟩. ⟨hal-01701461v2⟩
429 Consultations
544 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More