Convex minimization problems with weak constraint qualifications

Simple item page
dc.creatorLéonard, Christian
dc.date2007-10-08
dc.date.accessioned2026-07-07T08:34:41Z
dc.date.available2026-07-07T08:34:41Z
dc.descriptionOne 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.
dc.identifierhttps://arxiv.org/abs/0710.1463
dc.identifierhttp://arxiv.org/abs/0710.1463
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/139525
dc.subjectOptimization and Control
dc.subject46N10, 49J45, 28A35
dc.titleConvex minimization problems with weak constraint qualifications
dc.typetext

Files

Collections

arXiv