Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces

1994 ◽  
Vol 63 (3) ◽  
pp. 231-241 ◽  
Author(s):  
H. C. Lai ◽  
P. Szilágyi
1993 ◽  
Vol 54 (2) ◽  
pp. 213-220 ◽  
Author(s):  
M.Y. Bakier ◽  
K. El-Saady

2016 ◽  
Vol 101 (2) ◽  
pp. 277-287
Author(s):  
AARON TIKUISIS

It is shown that, for any field $\mathbb{F}\subseteq \mathbb{R}$, any ordered vector space structure of $\mathbb{F}^{n}$ with Riesz interpolation is given by an inductive limit of a sequence with finite stages $(\mathbb{F}^{n},\mathbb{F}_{\geq 0}^{n})$ (where $n$ does not change). This relates to a conjecture of Effros and Shen, since disproven, which is given by the same statement, except with $\mathbb{F}$ replaced by the integers, $\mathbb{Z}$. Indeed, it shows that although Effros and Shen’s conjecture is false, it is true after tensoring with $\mathbb{Q}$.


Author(s):  
Thomas W. Reiland

Interval-Lipschitz mappings between topological vector spaces are defined and compared with other Lipschitz-type operators. A theory of generalized gradients is presented when both spaces are locally convex and the range space is an order complete vector lattice. Sample applications to the theory of nonsmooth optimization are given.


Sign in / Sign up

Export Citation Format

Share Document