Stable and Total Fenchel Duality for Convex Optimization Problems in Locally Convex Spaces

DOI10.1137/080734352zbMath1189.49051OpenAlexW2019143618MaRDI QIDQ3563920

Marco A. López, Genaro López-Acedo, Chong Li, Dong Hui Fang

Publication date: 1 June 2010

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://idus.us.es/xmlui/handle/11441/41816

zbMATH Keywords

converse dualityconvex optimization in locally convex spacesstable and total Fenchel duality

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)

Related Items (27)

Stable and total Fenchel duality for composed convex optimization problems ⋮ A Comparison of Some Recent Regularity Conditions for Fenchel Duality ⋮ Some characterizations of duality for DC optimization with composite functions ⋮ Fenchel-Lagrange duality for DC infinite programs with inequality constraints ⋮ A Lagrange duality approach for multi-composed optimization problems ⋮ Convexity and closedness in stable robust duality ⋮ Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements ⋮ Total Lagrange duality for DC infinite optimization problems ⋮ On a zero duality gap result in extended monotropic programming ⋮ Approximate optimality conditions for composite convex optimization problems ⋮ Infimal convolution, \( c \)-subdifferentiability, and Fenchel duality in evenly convex optimization ⋮ Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces ⋮ Robust conjugate duality for convex optimization under uncertainty with application to data classification ⋮ Strong and total duality for constrained composed optimization via a coupling conjugation scheme ⋮ Optimality conditions for composite DC infinite programming problems ⋮ The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions ⋮ Characterizations of \(\varepsilon\)-duality gap statements for constrained optimization problems ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ New duality results for evenly convex optimization problems ⋮ Sequential optimality conditions for fractional optimization with applications to vector optimization ⋮ Strong and total Fenchel dualities for robust convex optimization problems ⋮ Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming ⋮ On the use of the quasi-relative interior in optimization ⋮ Stable strong Fenchel and Lagrange duality for evenly convex optimization problems ⋮ New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions ⋮ The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces ⋮ Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs

This page was built for publication: Stable and Total Fenchel Duality for Convex Optimization Problems in Locally Convex Spaces