Subdifferentiability of Convex Functions with Values in an Ordered Vector Space.
From MaRDI portal
Cited in
(39)- A generalization of the Fenchel-Moreau theorem
- Conjugate convex operators
- V-subdifferentials of convex operators
- A lemma on convex functionals in finite-dimensional spaces
- A selection principle with applications in convex analysis and optimization
- Lexocographic multipliers
- Regularizing the abstract convex program
- Subdifferentials of compactly Lipschitzian vector-valued functions
- Differentiability properties of convex operators
- A duality theorem for a convex programming problem in order complete vector lattices
- Sandwich theorems for convex operators with values in an ordered vector space
- A generalization of the Farkas lemma and applications to convex programming
- Order-preserving transformations and applications
- Henig proper subdifferential of set-valued maps
- Calculus rules of generalized \(\epsilon\)-subdifferential for vector valued mappings and applications
- \(\varepsilon k^ 0\)-subdifferentials of convex functions
- Regularization of vector equilibrium problems
- Set Optimization—A Rather Short Introduction
- Generalized weak subdifferentials
- Nonsmooth analysis of vector-valued mappings with contributions to nondifferentiable programming
- Continuity and Differentiability of Order-convex Functions onRn
- On non-differentiable convex functions
- Nondifferentiable optimization in banach space
- Asymptotic kuhn-tucker conditions in abstract spaces
- On optimality in abstract convex programming
- Nonvertical Affine Manifolds and Separation Theorems in Product Spaces
- scientific article; zbMATH DE number 61458 (Why is no real title available?)
- Convex operators: some subdifferentiability results
- A hahn-banach theorem in ordered linear spaces and its applications
- Vector subdifferentials via recession mappings∗∗this research was supported by grants from M.U.R.S.T (Itall) and the australian research council.$ef:
- Optimality conditions for vector optimization problems with difference of convex maps
- On the optimality conditions for D.C. vector optimization problems
- Pareto-Fenchel \({\epsilon}\)-subdifferential composition rule and \({\epsilon}\)-efficiency
- Focus on sufficient optimality conditions in D.C. vector optimization
- Optimality conditions for -weak local quasi-efficient solutions of D.C. vector optimization problems
- -weak Pareto minimality in D. C. vector optimization
- Nonlinear monotone operators with values in \({\mathcal L}(X,Y)\)
- Local convex analysis
- A duality theory for set-valued functions. I: Fenchel conjugation theory
This page was built for publication: Subdifferentiability of Convex Functions with Values in an Ordered Vector Space.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4776386)
