Cone arcwise connectivity in optimization problems with difference of set-valued mappings
From MaRDI portal
Sufficient Karush-Kuhn-Tucker type optimality conditions are provided for nonsmooth set-valued optimization problems where both the objective and the constraints are differences of set-valued maps. Weak, converse, and strong duality statements for the associated Wolfe type dual problems are provided, too. Some special cases are discussed as well.
Recommendations
- Optimization problems with difference of set-valued maps under generalized cone convexity
- SET-VALUED OPTIMIZATION PROBLEMS WITH (p, r)-ρ -CONE ARCWISE CONNECTEDNESS
- Set-valued minimax fractional programming problems under p-cone arcwise connectedness
- Optimality conditions and duality in optimization with generalized arcwise connectivity over convex cones
- Second-order optimality conditions for cone-subarcwise connected set-valued optimization problems
Cites work
- A Lagrange multiplier theorem and a sandwich theorem for convex relations.
- About contingent epiderivatives
- Approximate quasi efficiency of set-valued optimization problems via weak subdifferential
- Arcwise connected cone-convex functions and mathematical programming
- Conjugate maps and duality in multiobjective optimization
- Connectedness of Henig weakly efficient solution set for set-valued optimization problems
- Contingent epiderivatives and set-valued optimization
- Convex analysis and beyond. Volume I. Basic theory
- Global proper efficiency and vector optimization with cone-arcwise connected set-valued maps
- scientific article; zbMATH DE number 3760850 (Why is no real title available?)
- scientific article; zbMATH DE number 16313 (Why is no real title available?)
- scientific article; zbMATH DE number 3562783 (Why is no real title available?)
- Multivalued convexity and optimization: A unified approach to inequality and equality constraints
- On constrained set-valued optimization problems with \(\rho\)-cone arcwise connectedness
- On subdifferentials of set-valued maps
- Optimality conditions for approximate quasi efficiency in set-valued equilibrium problems
- Optimality conditions for D.C. vector optimization problems under reverse convex constraints
- Optimality conditions for parametric set-valued optimization problems via second-order contingent epiderivative
- Optimality conditions for set-valued minimax fractional programming problems
- Optimality conditions for the difference of convex set-valued mappings
- Optimality conditions for vector optimization problems of a difference of convex mappings
- Optimality conditions for weakly efficient elements of set-valued optimization with \(\alpha\)-order near cone-arcwise connectedness
- Optimality criteria in set-valued optimization
- Optimality of global proper efficiency for cone-arcwise connected set-valued optimization using contingent epiderivative
- Optimization problems with difference of set-valued maps under generalized cone convexity
- Second-order optimality conditions for cone-subarcwise connected set-valued optimization problems
- Set-valued analysis
- Set-valued fractional programming problems under generalized cone convexity
- Set-valued mapping monotonicity as characterization of D.C functions
- SET-VALUED OPTIMIZATION PROBLEMS WITH (p, r)-ρ -CONE ARCWISE CONNECTEDNESS
- Simplified optimality conditions for minimizing the difference of vector-valued functions
- Subdifferential and optimality conditions for the difference of set-valued mappings
- Sufficient optimality condition for vector optimization problems under D.C. data
- Sufficient optimality conditions and duality theorems for set-valued optimization problem under generalized cone convexity
- Variational analysis and applications
Cited in
(3)
This page was built for publication: Cone arcwise connectivity in optimization problems with difference of set-valued mappings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6642750)
