Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Duality for convex infinite optimization on linear spaces

Abstract : This note establishes a limiting formula for the conic Lagrangian dual of a convex infinite optimization problem, correcting the classical version of Karney [Math. Programming 27 (1983) 75-82] for convex semi-in…nite programs. A reformulation of the convex infinite optimization problem with a single constraint leads to a limiting formula for the corresponding Lagrangian dual, called supdual, and also for the primal problem in the case when strong Slater condition holds, which also entails strong sup-duality.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

https://hal-univ-avignon.archives-ouvertes.fr/hal-03540267
Contributor : Michel Volle Connect in order to contact the contributor
Submitted on : Sunday, January 23, 2022 - 4:46:34 PM
Last modification on : Tuesday, February 22, 2022 - 11:36:04 AM
Long-term archiving on: : Sunday, April 24, 2022 - 6:07:31 PM

File

GV_2021_12_07.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-03540267, version 1

Collections

Citation

M A Goberna, M Volle. Duality for convex infinite optimization on linear spaces. 2022. ⟨hal-03540267⟩

Share

Metrics

Record views

18

Files downloads

9