Existence theorems of cone saddle-points in set optimization applying nonlinear scalarizations
From MaRDI portal
Publication:5158617
Recommendations
- Scalarization and saddle-point for ic-cone-convexlike set-valued optimization problems
- Existence theorem of cone saddle-points applying a nonlinear scalarization
- Minimax theorems for set-valued mappings under cone-convexities
- Four types of nonlinear scalarizations and some applications in set optimization
- Strong efficient solutions of nearly cone-subconvexlike set-valued vector optimization problems characterized by generalized saddle point
Cited in
(9)- Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces
- On the ordinal structure of the weighted set relation
- Some properties of generalized oriented distance function and their applications to set optimization problems
- Existence theorem of cone saddle-points applying a nonlinear scalarization
- Scalarization and saddle-point for ic-cone-convexlike set-valued optimization problems
- Conjugate duality in set optimization via nonlinear scalarization
- On non-cooperative n-person games with set payoffs
- Existence and connectedness of the \(l\)-minimal approximate solutions for set optimization problems: an application in generalized multiobjective robustness
- Ekeland's variational principle for weighted set relation with set perturbation and application to game theory
This page was built for publication: Existence theorems of cone saddle-points in set optimization applying nonlinear scalarizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5158617)
