Saddlepoints for convex programming in order vector spaces
Shizheng Li · Optimization · 1988
In this paper we characterize the existence of saddlepoints for optimization problems in order complete vector spaces by the existence of order automorphisms of vector space, by the existence of subgradients of the associated perturbing function, and by the existence of directional derivatives of the perturbing function, respectively. The statement of this paper is purely algebraic.