A duality theorem for a convex programming problem in order complete vector lattices
From MaRDI portal
Publication:1220873
DOI10.1016/0022-247X(75)90022-0zbMath0314.90079MaRDI QIDQ1220873
Publication date: 1975
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Related Items (43)
A survey of vector optimization in infinite-dimensional spaces. II ⋮ Duality in vector optimization ⋮ Applications sous-linéaires à valeurs dans un espace de fonction continues. (Sublinear mappings with values in a space of continuous functions) ⋮ A duality theory for set-valued functions. I: Fenchel conjugation theory ⋮ A Fenchel-Moreau theorem for $\bar L^0$-valued functions ⋮ On supremum of a set in a multidimensional space ⋮ Sandwich theorem and supportability for partially defined convex operators ⋮ Strong duality for infinite-dimensional vector-valued programming problems ⋮ Nonsmooth analysis of vector-valued mappings with contributions to nondifferentiable programming ⋮ Optimality for set functions with values in ordered vector spaces ⋮ A selection principle with applications in convex analysis and optimization ⋮ Continuous affine support mappings for convex operators ⋮ Hahn-Banach-type theorems and applications to optimization for partially ordered vector space-valued invariant operators ⋮ Duality for nonlinear multiple-criteria optimization problems ⋮ Subdifferential calculus for convex operators ⋮ Subdifferentials of compactly Lipschitzian vector-valued functions ⋮ Subdifferentials of nonconvex vector-valued functions ⋮ Duality theory and slackness conditions in multiobjective linear programming ⋮ Vector subdifferentials via recession mappings∗∗this research was supported by grants from M.U.R.S.T (Itall) and the australian research council.$ef: ⋮ Duality for set-valued multiobjective optimization problems. I: Mathematical programming ⋮ Saddlepoints for convex programming in order vector spaces ⋮ The relations among the three kinds of conditional risk measures ⋮ A unified approach to duality in convex programming ⋮ Recent progress in random metric theory and its applications to conditional risk measures ⋮ Saddlepoint Problems in Nondifferentiable Programming ⋮ The saddle point theorem of Kuhn and Tucker in ordered vector spaces ⋮ Sandwich theorems for convex operators with values in an ordered vector space ⋮ Duality in nonconvex vector optimization ⋮ Multiobjective duality without convexity ⋮ Set Optimization—A Rather Short Introduction ⋮ Hahn-Banach and sandwich theorems for equivariant vector lattice-valued operators and applications ⋮ Hahn-Banach-type theorems and subdifferentials for invariant and equivariant order continuous vector lattice-valued operators with applications to optimization ⋮ A new extension theorem for concave operators ⋮ The Fenchel-Moreau Theorem for Set Functions ⋮ Solution concepts in vector optimization: a fresh look at an old story ⋮ A Fenchel–Rockafellar duality theorem for set-valued optimization ⋮ Compact nets, filters, and relations ⋮ A generalization of the Fenchel-Moreau theorem ⋮ Local convex analysis ⋮ Saddle points and duality in multi-objective programming ⋮ Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces ⋮ Conjugate convex operators ⋮ Stochastic measures of arbitrage.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The saddle point theorem of Kuhn and Tucker in ordered vector spaces
- Extension of Fenchel's duality theorem for convex functions
- Optimization theory in linear spaces. III: Mathematical programming in partially ordered Banach spaces
- Subdifferentiability of Convex Functions with Values in an Ordered Vector Space.
- Sous-Différentiabilité de fonctions convexes à valeurs dans un espace vectoriel ordonné.
- On Conjugate Convex Functions
This page was built for publication: A duality theorem for a convex programming problem in order complete vector lattices
