✦ LIBER ✦

Saddlepoints for convex programming in order vector spaces

✍ Scribed by Shizheng, Li

Book ID: 125518706
Publisher: Taylor and Francis Group
Year: 1988
Tongue: English
Weight: 347 KB
Volume: 19
Category: Article
ISSN: 0233-1934
DOI: 10.1080/02331938808843347

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Alternative theorems and saddlepoint res

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

✍ H. C. Lai; P. Szilágyi 📂 Article 📅 1994 🏛 Akadmiai Kiad 🌐 English ⚖ 492 KB

A dual problem for convex programming in

A dual problem for convex programming in ordered vector spaces

✍ Shizheng, Li 📂 Article 📅 1990 🏛 Taylor and Francis Group 🌐 English ⚖ 364 KB

A duality theorem for a convex programmi

A duality theorem for a convex programming problem in order complete vector lattices

✍ Jochem Zowe 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 745 KB

Nonlinear programming in locally convex

Nonlinear programming in locally convex spaces

✍ B. D. Craven 📂 Article 📅 1972 🏛 Springer 🌐 English ⚖ 666 KB

Sandwich theorems for convex operators w

Sandwich theorems for convex operators with values in an ordered vector space

✍ Jochem Zowe 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 720 KB

Convex analysis in general vector spaces

✍ C. Zalinescu 📂 Library 📅 2002 🏛 World Scientific 🌐 English ⚖ 4 MB

The primary aim of this book is to present the conjugate and subdifferential calculus using the method of perturbation functions in order to obtain the most general results in this field. The secondary aim is to provide important applications of this calculus and of the properties of convex function