Zero Duality Gap and Attainment with Possibly Non-Convex Data - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Convex Analysis Année : 2016

Zero Duality Gap and Attainment with Possibly Non-Convex Data

Emil Ernst
  • Fonction : Auteur
  • PersonId : 7306
  • IdHAL : emil-ernst
Michel Volle
  • Fonction : Auteur
  • PersonId : 842953

Résumé

A newly defined notion of convex closedness regarding a set is used in order to state a necessary and sufficient criterion for the min-sup property in non necessarily convex primal-dual optimization problems, generalizing well-known theorems valid in the convex setting. Our main result is then applied to the classical penalty method.
Fichier non déposé

Dates et versions

hal-01481759 , version 1 (02-03-2017)

Identifiants

  • HAL Id : hal-01481759 , version 1

Citer

Emil Ernst, Michel Volle. Zero Duality Gap and Attainment with Possibly Non-Convex Data . Journal of Convex Analysis, 2016, 23 (2), pp.615-629. ⟨hal-01481759⟩
228 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More