Minimax Theorems for Set-Valued Mappings under Cone-Convexities | Zendy

Yen-Cherng Lin | Zendy; Qamrul Hasan Ansari | Zendy; Hang–Chin Lai | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Minimax Theorems for Set-Valued Mappings under Cone-Convexities

Author(s) -

Yen-Cherng Lin,

Qamrul Hasan Ansari,

Hang–Chin Lai

Publication year - 2012

Publication title -

abstract and applied analysis

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.228

H-Index - 56

eISSN - 1687-0409

pISSN - 1085-3375

DOI - 10.1155/2012/310818

Subject(s) - minimax , mathematics , cone (formal languages) , set (abstract data type) , saddle point , saddle , pure mathematics , discrete mathematics , mathematical economics , mathematical optimization , algorithm , computer science , geometry , programming language

The aim of this paper is to study the minimax theorems for set-valued mappings with or without linear structure. We define several kinds of cone-convexities for set-valued mappings, give some examples of such set-valued mappings, and study the relationships among these cone-convexities. By using our minimax theorems, we derive some existence results for saddle points of set-valued mappings. Some examples to illustrate our results are also given.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research