Stable strong Fenchel and Lagrange duality for evenly convex optimization problems

DOI10.1080/02331934.2016.1167207zbMath1349.90678OpenAlexW2325192077MaRDI QIDQ2817240

No author found.

Publication date: 29 August 2016

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10045/66595

zbMATH Keywords

evenly convex functiongeneralized convex conjugationLagrange and Fenchel dual problems

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15) Convexity of real functions of several variables, generalizations (26B25)

Related Items

Set-valued evenly convex functions: characterizations and C-conjugacy ⋮ Convexity and closedness in stable robust duality ⋮ Optimization of first-order Nicoletti boundary value problem with discrete and differential inclusions and duality ⋮ Duality and optimality conditions for reverse convex programs via a convex decomposition ⋮ Necessary optimality conditions for vector reverse convex minimization problems via a conjugate duality ⋮ Strong and total duality for constrained composed optimization via a coupling conjugation scheme ⋮ Necessary and sufficient conditions for strong Fenchel-Lagrange duality via a coupling conjugation scheme ⋮ New duality results for evenly convex optimization problems ⋮ \(e^{\prime }\)-convex sets and functions: properties and characterizations ⋮ An Extended Fenchel--Lagrange Duality Approach and Optimality Conditions for Strong Bilevel Programming Problems

Cites Work

• Lagrange duality for evenly convex optimization problems
• The e-support function of an e-convex set and conjugacy for e-convex functions
• New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
• Characterizations of evenly convex sets and evenly quasiconvex functions
• On linear systems containing strict inequalities
• Infimal convolution, \( c \)-subdifferentiability, and Fenchel duality in evenly convex optimization
• On strong and total Lagrange duality for convex optimization problems
• Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
• Necessary and sufficient conditions for stable conjugate duality
• Stable and Total Fenchel Duality for Convex Optimization Problems in Locally Convex Spaces
• A simple closure condition for the normal cone intersection formula