Infimal convolution, \( c \)-subdifferentiability, and Fenchel duality in evenly convex optimization
From MaRDI portal
Publication:1939075
DOI10.1007/s11750-011-0208-6zbMath1286.90109OpenAlexW2085138249MaRDI QIDQ1939075
Margarita M. L. Rodríguez, José Vicente-Pérez, M. D. Fajardo
Publication date: 26 February 2013
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-011-0208-6
Convex programming (90C25) Programming in abstract spaces (90C48) Convexity of real functions of several variables, generalizations (26B25)
Related Items
A comparison of alternative c-conjugate dual problems in infinite convex optimization ⋮ On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions ⋮ 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 ⋮ Stable strong Fenchel and Lagrange duality for evenly convex optimization problems ⋮ Even convexity, subdifferentiability, and {\(\Gamma\)}-regularization in general topological vector spaces ⋮ Lagrange duality for evenly convex optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The e-support function of an e-convex set and conjugacy for e-convex functions
- Convex functions, monotone operators and differentiability.
- Fenchel duality in infinite-dimensional setting and its applications.
- Characterizations of evenly convex sets and evenly quasiconvex functions
- On linear systems containing strict inequalities
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- Extension of Fenchel's duality theorem for convex functions
- Analyzing linear systems containing strict inequalities via evenly convex hulls
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- Duality in Vector Optimization
- A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
- Conjugacy in quasi-convex programming
- Stable and Total Fenchel Duality for Convex Optimization Problems in Locally Convex Spaces
- Generalized Moreau–Rockafellar results for composed convex functions
- Quasiconvex duality theory by generalized conjugation methods
- Convex Analysis
