Necessary and sufficient conditions for strong Fenchel-Lagrange duality via a coupling conjugation scheme

DOI10.1007/s10957-017-1209-xzbMath1386.52001OpenAlexW2776611667MaRDI QIDQ1706407

Peng Zhang

Publication date: 22 March 2018

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-017-1209-x

zbMATH Keywords

evenly convex functiongeneralized convex conjugationclosedness type regularity conditionFenchel-Lagrange dual problem

Mathematics Subject Classification ID

Convex programming (90C25) Duality theory (optimization) (49N15) Convexity of real functions of several variables, generalizations (26B25) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (8)

Set-valued evenly convex functions: characterizations and C-conjugacy ⋮ On duality in second-order discrete and differential inclusions with delay ⋮ Strong and total duality for constrained composed optimization via a coupling conjugation scheme ⋮ New duality results for evenly convex optimization problems ⋮ \(e^{\prime }\)-convex sets and functions: properties and characterizations ⋮ Infimal convolution and duality in problems with third-order discrete and differential inclusions ⋮ Infimal convolution and duality in convex optimal control problems with second order evolution differential inclusions ⋮ Optimization of boundary value problems for higher order differential inclusions and duality

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lagrange duality for evenly convex optimization problems
• The e-support function of an e-convex set and conjugacy for e-convex functions
• A Fenchel-Lagrange duality approach for a bilevel programming problem with extremal-value function
• New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
• Strong duality for generalized convex optimization problems
• 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
• Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
• Fenchel-Lagrange duality versus geometric duality in convex optimization
• The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
• Inf-convolution, sous-additivite, convexite des fonctions numériques
• Stable strong Fenchel and Lagrange duality for evenly convex optimization problems
• Duality in Vector Optimization
• A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
• Generalized Moreau–Rockafellar results for composed convex functions
• An Extended Fenchel--Lagrange Duality Approach and Optimality Conditions for Strong Bilevel Programming Problems
• A comparison of alternative c-conjugate dual problems in infinite convex optimization
• Generalized Convexity, Generalized Monotonicity and Nonsmooth Analysis

This page was built for publication: Necessary and sufficient conditions for strong Fenchel-Lagrange duality via a coupling conjugation scheme