New glimpses on convex infinite optimization duality
type: Item
instance of: scholarly article
title: New glimpses on convex infinite optimization duality
zbMATH Open document ID: 1359.90152
author: Miguel Angel Goberna
author: Marco Antonio López Cerdá
author: M. Volle
published in: Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A: Matemáticas. RACSAM
publication date: 2015-09-21T00:00:00Z
full work available at URL: http://hdl.handle.net/10045/51991
review text: Let \(X\) be a separated locally convex topological space, \(C\subset X\) be a nonempty closed convex set, \(T\) be a possibly infinite index set, \(\mathbb{R}^{(T)}_+:= \{\lambda: T\to R_+\mid\text{supp\,}\lambda\text{ is finite}\}\) and let \(f\) and \(f_t\) \((t\in T)\) be convex lsc proper extended real-valued functions with \(M:=\bigcap_{t\in T}\text{dom\,}f_t\). For the convex optimization problem (P) \(\inf_x f(x)\) s.t. \(x\in C\), \(f_t(x)\leq 0\), \(t\in T\), the authors discuss the dual problems, (D) \(\sup_\lambda\inf_{x\in C}(f(x)+ \sum_{t\in T}\lambda_t f_t(x))\) s.t. \(\lambda= (\lambda_t)_{t\in T}\in\mathbb{R}^{(T)}_+\), (Q) \(\sup_\lambda\inf_{x\in C\cap M}(f(x)+\sum_{t\in T}\lambda_t f_t(x))\) s.t. \(\lambda=(\lambda_t)_{t\in T}\in\mathbb{R}^{(T)}_+\), \((\Delta)\) \(\sup_\lambda\inf_{x\in C}(f(x)+ \sum_{t\in T}\lambda_t f_t(x))\) s.t. \(\lambda= (\lambda_t)_{t\in T}\in \mathbb{R}^{(T)}_+\setminus\{0_T\}\). Obviously, it is \(\sup(\Delta)\leq \sup(\text{D})\leq \sup(\text{Q})\leq\inf(\text{P})\). Sufficient conditions (essentially closedness conditions to associated epigraphical sets) are provided such that strong duality holds in sense of \(\inf(\text{P})= \max(\text{D})\), \(\inf(\text{P})= \max(\text{Q})\) and \(\inf(\text{P})= \max(\Delta)\), respectively. The second part of the paper is devoted to the minsup property. Sufficient conditions (based on the notion of quasicontinuity and recession assumptions) are proposed which guarantee \(\min(\text{P})= \sup(\Delta)\). The paper is finished with some applications of the obtained results.
reviewed by: Jörg Thierfelder
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 49N15
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 46N10
zbMATH DE Number: 6483920
zbMATH Keywords: convex infinite programming
zbMATH Keywords: duality
MaRDI profile type: Publication
OpenAlex ID: W2000073237
cites work: Conjugate duality in convex optimization
cites work: Q3425534
cites work: New Farkas-type constraint qualifications in convex infinite programming
cites work: Zero duality gap for convex programs: a generalization of the Clark-Duffin theorem
cites work: Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
cites work: Q4357206
cites work: Q5176687
cites work: Zero duality gaps in infinite-dimensional programming
cites work: Q5677294
cites work: Q5650526
cites work: Q4376751
cites work: Convex Analysis
cites work: Q3149262
DOI: 10.1007/S13398-014-0194-2
description: scientific article; zbMATH DE number 6483920