On cone convexity of set-valued maps
From MaRDI portal
Publication:4377216
DOI10.1016/S0362-546X(97)00213-7zbMath0895.26010MaRDI QIDQ4377216
Tamaki Tanaka, Daishi Kuroiwa, Trúóng Xuân Dúc Hā
Publication date: 25 August 1998
Published in: Nonlinear Analysis: Theory, Methods & Applications (Search for Journal in Brave)
Set-valued functions (26E25) Convex functions and convex programs in convex geometry (52A41) Convexity of real functions of several variables, generalizations (26B25)
Related Items (only showing first 100 items - show all)
Directional and approximate efficiency in set optimization ⋮ Unnamed Item ⋮ Certainty equivalent and utility indifference pricing for incomplete preferences via convex vector optimization ⋮ A duality theory for set-valued functions. I: Fenchel conjugation theory ⋮ Existence theorems for set optimization problems ⋮ On the ordinal structure of the weighted set relation ⋮ A set optimization approach to zero-sum matrix games with multi-dimensional payoffs ⋮ On the stability of the solution set mappings to parametric set optimization problems ⋮ Convergence of solutions of a set optimization problem in the image space ⋮ A Hausdorff-type distance, a directional derivative of a set-valued map and applications in set optimization ⋮ Convex-cone-based comparisons of and difference evaluations for fuzzy sets ⋮ An alternative theorem for set-valued maps via set relations and its application to robustness of feasible sets ⋮ A set-valued generalization of Ricceri's theorem related to Fan-Takahashi minimax inequality ⋮ \((\Lambda ,C)\)-contingent derivatives of set-valued maps ⋮ A Hausdorff-type distance, the Clarke generalized directional derivative and applications in set optimization problems ⋮ Characterizations of set relations with respect to variable domination structures via oriented distance function ⋮ Set-valued evenly convex functions: characterizations and C-conjugacy ⋮ Karush-Kuhn-Tucker conditions in set optimization ⋮ About Hahn-Banach extension theorems and applications to set-valued optimization ⋮ Quasiconvexity of set-valued maps assures well-posedness of robust vector optimization ⋮ Connectedness of weak minimal solution set for set optimization problems ⋮ Partial order relations on family of sets and scalarizations for set optimization ⋮ Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps ⋮ Strict approximate solutions in set-valued optimization with applications to the approximate Ekeland variational principle ⋮ Convex solutions of the multi-valued iterative equation of order \(n\) ⋮ On solutions of set-valued optimization problems ⋮ A topological convergence on power sets well-suited for set optimization ⋮ Approximate solutions for set optimization with an order cone that has nonempty quasirelative interiors ⋮ Some minimax theorems of set-valued maps and their applications ⋮ Further characterizations of possibility-theoretical indices in fuzzy optimization ⋮ Conjugate duality in set optimization via nonlinear scalarization ⋮ Pointwise well-posedness in set optimization with cone proper sets ⋮ Four types of nonlinear scalarizations and some applications in set optimization ⋮ On proper minimality in set optimization ⋮ Global well-posedness of set-valued optimization with application to uncertain problems ⋮ Semicontinuity of the minimal solution mappings to parametric set optimization problems on Banach lattices ⋮ Optimality conditions in set-valued optimization problem with respect to a partial order relation via directional derivative ⋮ Scalar Lagrange multiplier rules for set-valued problems in infinite-dimensional spaces ⋮ On approximate solutions in set-valued optimization problems ⋮ Well-posedness and stability of solutions for set optimization problems ⋮ A calculation approach to scalarization for polyhedral sets by means of set relations ⋮ A Minty variational principle for set optimization ⋮ Solving set optimization problems based on the concept of null set ⋮ Lagrangian duality in set-valued optimization ⋮ An ε-Minimax Theorem for Bi-Lower-Semicontinuous Set-Valued Mappings ⋮ Optimality conditions and minimax properties in set optimization ⋮ A steepest descent method for set optimization problems with set-valued mappings of finite cardinality ⋮ Variational inequalities characterizing weak minimality in set optimization ⋮ Qualitative properties of solutions to set optimization problems ⋮ Set approach for set optimization with variable ordering structures. I: Set relations and relationship to vector approach ⋮ Set approach for set optimization with variable ordering structures. II: Scalarization approaches ⋮ Directional derivatives in set optimization with the set less order relation ⋮ Lagrange duality in set optimization ⋮ Computational methods for set-relation-based scalarizing functions ⋮ Nonlinear scalarization functions and polar cone in set optimization ⋮ Local dense solutions for equilibrium problems with applications to noncooperative games ⋮ A unified approach to uncertain optimization ⋮ Fan's inequalities for vector-valued multifunctions ⋮ Cone-semicontinuity of set-valued maps by analogy with real-valued semicontinuity ⋮ New order relations in set optimization ⋮ A vectorization for nonconvex set-valued optimization ⋮ Scalarization in set optimization with solid and nonsolid ordering cones ⋮ On robustness for set-valued optimization problems ⋮ Lagrange Multiplier Rules for Weakly Minimal Solutions of Compact-Valued Set Optimization Problems ⋮ A new nonlinear scalarization function and applications ⋮ Continuity of solutions for parametric set optimization problems via scalarization methods ⋮ Some equivalent problems in set optimization ⋮ Set Optimization—A Rather Short Introduction ⋮ Generalized Minimality in Set Optimization ⋮ On Characterization of Nash Equilibrium Strategy in Bi-Matrix Games with Set Payoffs ⋮ Optimality conditions for set-valued maps with set optimization ⋮ Minimax theorems for set-valued maps without continuity assumptions ⋮ Six set scalarizations based on the oriented distance: properties and application to set optimization ⋮ On set containment characterizations for sets described by set-valued maps with applications ⋮ Unnamed Item ⋮ Editorial. Choosing sets: preface to the special issue on set optimization and applications ⋮ Characterization of set relations through extensions of the oriented distance ⋮ Ekeland's variational principle with weighted set order relations ⋮ A new concept of slope for set-valued maps and applications in set optimization studied with Kuroiwa's set approach ⋮ On Lagrange Multiplier Rules for Set-Valued Optimization Problems in the Sense of Set Criterion ⋮ Epidifferentiability and hypodifferentiability of pseudoconvex maps in set-optimization problems ⋮ A note on semicontinuity of the solution mapping for parametric set optimization problems ⋮ EXISTENCE OF SOLUTIONS FOR SET-VALUED QUASI-EQUILIBRIUM PROBLEMS AND FIXED POINT PROBLEMS ON EUCLIDEAN SPACES ⋮ Scalar characterizations of cone-continuous set-valued maps ⋮ Optimality conditions in set-valued optimization problems with respect to a partial order relation by using subdifferentials ⋮ Existence theorems of set optimization with set-valued maps ⋮ The stability of the solution sets for set optimization problems via improvement sets ⋮ Levitin-Polyak well-posedness for set optimization problems involving set order relations ⋮ Set Relations via Families of Scalar Functions and Approximate Solutions in Set Optimization ⋮ Minimal element theorems revisited ⋮ A Fenchel–Rockafellar duality theorem for set-valued optimization ⋮ A scalarization method for fuzzy set optimization problems ⋮ Well-posedness for set optimization problems involving set order relations ⋮ Continuity of solution maps to parametric set optimization problems via parametric equilibrium problems ⋮ Minimax theorems for set-valued mappings. ⋮ A derivative-free descent method in set optimization ⋮ A fuzzy ordering on multi-dimensional fuzzy sets induced from convex cones ⋮ Set-relations and optimality conditions in set-valued maps ⋮ Lagrange multipliers, duality, and sensitivity in set-valued convex programming via pointed processes ⋮ Characterization of fuzzy order relation by fuzzy cone
Cites Work
- Existence and Lagrangian duality for maximization of set-valued functions
- Conjugate maps and duality in multiobjective optimization
- Duality theory in multiobjective programming
- Generalized quasiconvexities, cone saddle points, and minimax theorem for vector-valued functions
- Existence theorems for saddle points of vector-valued maps
- Convexity for set-valued maps
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- A saddlepoint theorem for set-valued maps
- Multivalued convexity and optimization: A unified approach to inequality and equality constraints
- An Existence Theorem in Vector Optimization
- Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C1-Optimization
- Set-valued analysis
- Optimality conditions for maximizations of set-valued functions
- Unnamed Item
- Unnamed Item
This page was built for publication: On cone convexity of set-valued maps
