Saddlepoints for convex programming in order vector spaces
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4041659
- scientific article; zbMATH DE number 4037616
- Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces
- Saddlepoint Problems in Nondifferentiable Programming
- Existence theorems of saddle points for vector valued functions
Cites work
- A duality theorem for a convex programming problem in order complete vector lattices
- scientific article; zbMATH DE number 3678488 (Why is no real title available?)
- scientific article; zbMATH DE number 3323651 (Why is no real title available?)
- The saddle point theorem of Kuhn and Tucker in ordered vector spaces
Cited in
(8)- The convex vector programming on an order complete ordered topological vector space
- Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces
- On the existence of a saddle value
- scientific article; zbMATH DE number 4037616 (Why is no real title available?)
- scientific article; zbMATH DE number 4041659 (Why is no real title available?)
- Necessary and sufficient conditions for regularity of constraints in convex programming
- A dual problem for convex programming in ordered vector spaces
- Saddlepoint Problems in Nondifferentiable Programming
This page was built for publication: Saddlepoints for convex programming in order vector spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3804456)