Set-valued evenly convex functions: characterizations and C-conjugacy
From MaRDI portal
Publication:2158823
DOI10.1007/s11228-021-00621-0zbMath1504.26086OpenAlexW4220742583MaRDI QIDQ2158823
Publication date: 26 July 2022
Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11228-021-00621-0
set-valued functionsFenchel-Moreau theorempartially ordered spacesconvex conjugationevenly convex sets
Cites Work
- Unnamed Item
- 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 duality theory for set-valued functions. I: Fenchel conjugation theory
- Necessary and sufficient conditions for strong Fenchel-Lagrange duality via a coupling conjugation scheme
- Characterizations of evenly convex sets and evenly quasiconvex functions
- On linear systems containing strict inequalities
- Even convexity and optimization. Handling strict inequalities
- Inf-convolution, sous-additivite, convexite des fonctions numériques
- Analyzing linear systems containing strict inequalities via evenly convex hulls
- Duality between direct and indirect utility functions under minimal hypotheses
- Stable strong Fenchel and Lagrange duality for evenly convex optimization problems
- Conjugacy in quasi-convex programming
- Quasiconvex duality theory by generalized conjugation methods
- On cone convexity of set-valued maps
- A comparison of alternative c-conjugate dual problems in infinite convex optimization
- Set-valued Optimization
- On Quasi-Convex Duality
This page was built for publication: Set-valued evenly convex functions: characterizations and C-conjugacy