A minimax theorem for vector-valued functions in lexicographic order
From MaRDI portal
Publication:984081
DOI10.1016/j.na.2010.04.047zbMath1204.49021MaRDI QIDQ984081
Xiao-bing Li, Zhi-Miao Fang, Sheng Jie Li
Publication date: 13 July 2010
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2010.04.047
49K35: Optimality conditions for minimax problems
Related Items
Ky Fan minimax inequalities for set-valued mappings, Minimax theorems for scalar set-valued mappings with nonconvex domains and applications, Some minimax problems in lexicographic order, Existence theorems of \(\varepsilon\)-cone saddle points for vector-valued mappings, Minimax inequalities for set-valued mappings, Lagrangian duality for multiobjective programming problems in lexicographic order, Minimax problems for set-valued mappings with set optimization, Minimax Problems for Set-Valued Mappings, Relaxation of constraints in lexicographic multiobjective programming problems
Cites Work
- Unnamed Item
- On lexicographic vector equilibrium problems
- A dual-based algorithm for solving lexicographic multiple objective programs
- Two types of minimax theorems for vector-valued functions
- A minimax theorem for vector-valued functions. II
- Some minimax problems of vector-valued functions
- A minimax theorem for vector-valued functions
- Lexicographical order and duality in multiobjective programming
- Some minimax theorems in vector-valued functions
- Minimax and fixed point theorems
- Minimax theorems for set-valued mappings.
- Minimax theorems and cone saddle points of uniformly same-order vector- valued functions
- The strong minimax theorem and strong saddle points of vector-valued functions
- A generalized section theorem and a minimax inequality for a vector-valued mapping1
- Exceptional Paper—Lexicographic Orders, Utilities and Decision Rules: A Survey
- Minimax Theorems
