The e-support function of an e-convex set and conjugacy for e-convex functions
A subset of a l.c. real topological vector space is said to be evenly convex (or e-convex), if it is the intersection of a family of open halfspaces. A function is called e-convex, if its epigraph is an e-convex set. These notions have been introduced recently by the authors of the paper under review (to appear in J. Convex Anal.). The authors introduce now certain new definitions and related properties of e-convex functions. For example, they introduce a suitable support functions for e-convex sets as well as a conjugation scheme for e-convex functions. These are necessary, as the classical support function, or the classical Fenchel conjugation of convex analysis are not appropriate here.
- \(E\)-convex sets, \(E\)-convex functions, and \(E\)-convex programming
- \(e^{\prime }\)-convex sets and functions: properties and characterizations
- On \(E\)-convex sets, \(E\)-convex functions, and \(E\)-convex programming
- scientific article; zbMATH DE number 123469
- Support functions of general convex sets
- Support convex sets and set mappings for convex functions
- On a support function on a convex cone
- scientific article; zbMATH DE number 7404238
- Some properties of E-convex functions
- On support points and support functionals of convex sets
- Analyzing linear systems containing strict inequalities via evenly convex hulls
- Basic properties of evenly convex sets
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 3320765 (Why is no real title available?)
- scientific article; zbMATH DE number 2226571 (Why is no real title available?)
- scientific article; zbMATH DE number 3075425 (Why is no real title available?)
- On evenly convex functions
- On linear systems containing strict inequalities
- Recent contributions to linear semi-infinite optimization
- Necessary and sufficient conditions for strong Fenchel-Lagrange duality via a coupling conjugation scheme
- Infimal convolution, c -subdifferentiability, and Fenchel duality in evenly convex optimization
- Conditionally evenly convex sets and evenly quasi-convex maps
- \(e^{\prime }\)-convex sets and functions: properties and characterizations
- Set-valued evenly convex functions: characterizations and C-conjugacy
- Even convexity, subdifferentiability, and {\(\Gamma\)}-regularization in general topological vector spaces
- Lagrange duality for evenly convex optimization problems
- Duality for closed convex functions and evenly convex functions
- On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions
- Stable strong Fenchel and Lagrange duality for evenly convex optimization problems
- Zero duality gap conditions via abstract convexity
- Evenly convex sets, and evenly quasiconvex functions, revisited
- New duality results for evenly convex optimization problems
- A comparison of alternative c-conjugate dual problems in infinite convex optimization
- On e-convex functions and e-subdifferentials in locally convex spaces
- Strong and total duality for constrained composed optimization via a coupling conjugation scheme
- On Fenchel c -conjugate dual problems for DC optimization: characterizing weak, strong and stable strong duality
- Optimality conditions and total Lagrange dualities for evenly convex optimization problems
- Lagrange duality on DC evenly convex optimization problems via a generalized conjugation scheme
- Perturbational approach to duality in evenly convex set-valued optimization
- Perturbational duality in optimization under evenly convex assumptions
This page was built for publication: The e-support function of an e-convex set and conjugacy for e-convex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q624622)
