Convex minimization problems with weak constraint qualifications - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Convex Analysis Année : 2010

Convex minimization problems with weak constraint qualifications

Christian Léonard
  • Fonction : Auteur
  • PersonId : 944163

Résumé

One revisits the standard saddle-point method based on conjugate duality for solving convex minimization problems. Our aim is to reduce or remove unnecessary topological restrictions on the constraint set. Dual equalities and characterizations of the minimizers are obtained with weak or without constraint qualifications. The main idea is to work with intrinsic topologies which reflect some geometry of the objective function. The abstract results of this article are applied in other papers to the Monge-Kantorovich optimal transport problem and the minimization of entropy functionals.
Fichier principal
Vignette du fichier
saddle-hal.pdf (317.88 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00177360 , version 1 (07-10-2007)

Identifiants

Citer

Christian Léonard. Convex minimization problems with weak constraint qualifications. Journal of Convex Analysis, 2010, 17 (1), pp.321-348. ⟨hal-00177360⟩
159 Consultations
38 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More