The Fenchel-Moreau Theorem for Set Functions
From MaRDI portal
Convex programming (90C25) Nonsmooth analysis (49J52) Convexity of real functions in one variable, generalizations (26A51) Set-valued functions (26E25) Methods involving semicontinuity and convergence; relaxation (49J45) Set-valued maps in general topology (54C60) Duality theory (optimization) (49N15)
Recommendations
- Set functions and Souslin’s hypothesis
- scientific article; zbMATH DE number 4101521
- scientific article; zbMATH DE number 3845890
- Moreau-Rockafellar type theorem for convex set functions
- Dieudonné's theorem for non-additive set functions
- scientific article; zbMATH DE number 5676608
- scientific article; zbMATH DE number 3953138
- scientific article; zbMATH DE number 819294
- scientific article; zbMATH DE number 3912678
- On a theorem of Cellina for set valued functions
Cites work
- scientific article; zbMATH DE number 3855760 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- A duality theorem for a convex programming problem in order complete vector lattices
- A generalization of the Fenchel-Moreau theorem
- Convex programming on spaces of measurable functions
- Duality in mathematical programming of set functions: On Fenchel duality theorem
- Mathematical methods of game and economic theory
- On multiple objective programming problems with set functions
- Optimal constrained selection of a measurable subset
- Saddle point and duality in the optimization theory of convex set functions
- Second order optimality conditions for mathematical prograramming with set functions
Cited in
(17)- scientific article; zbMATH DE number 3845890 (Why is no real title available?)
- Optimality of differentiable, vector-valued n-set functions
- Minimax fractional programming for n-set functions and mixed-type duality under generalized Invexity
- Optimality for set functions with values in ordered vector spaces
- Duality theorems of vector-valued \(n\)-set functions
- Duality for a minimax programming problem containing n-set functions
- Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces
- On several results about convex set functions
- scientific article; zbMATH DE number 819294 (Why is no real title available?)
- Fubini's Theorem for Null Sets
- A primal-dual algorithm for nonnegative N-th order CP tensor decomposition: application to fluorescence spectroscopy data analysis
- Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions
- On the optimality conditions of vector-valued n-set functions
- A Fenchel-Moreau theorem for \bar L^0-valued functions
- Duality theorems for convex and quasiconvex set functions
- On minimax fractional programming of generalized convex set functions
- On the optimality of differentiable nonconvex n-set functions
This page was built for publication: The Fenchel-Moreau Theorem for Set Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3788604)
