Cone arcwise connectivity in optimization problems with difference of set-valued mappings
From MaRDI portal
Publication:6642750
DOI10.1007/S40324-023-00338-0MaRDI QIDQ6642750
Savin Treanţă, Koushik Das, Izhar Ahmad
Publication date: 25 November 2024
Published in: S\(\vec{\text{e}}\)MA Journal (Search for Journal in Brave)
Set-valued and variational analysis (49J53) Duality theory (optimization) (49N15) Convexity of real functions of several variables, generalizations (26B25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Connectedness of Henig weakly efficient solution set for set-valued optimization problems
- Set-valued fractional programming problems under generalized cone convexity
- Optimality conditions for set-valued minimax fractional programming problems
- Optimality conditions for vector optimization problems of a difference of convex mappings
- Optimality conditions for D.C. vector optimization problems under reverse convex constraints
- Optimality conditions for the difference of convex set-valued mappings
- About contingent epiderivatives
- Set-valued mapping monotonicity as characterization of D.C functions
- Conjugate maps and duality in multiobjective optimization
- On subdifferentials of set-valued maps
- Contingent epiderivatives and set-valued optimization
- Arcwise connected cone-convex functions and mathematical programming
- Sufficient optimality condition for vector optimization problems under D.C. data
- Approximate quasi efficiency of set-valued optimization problems via weak subdifferential
- Second-order optimality conditions for cone-subarcwise connected set-valued optimization problems
- Subdifferential and optimality conditions for the difference of set-valued mappings
- Sufficient optimality conditions and duality theorems for set-valued optimization problem under generalized cone convexity
- Optimality conditions for approximate quasi efficiency in set-valued equilibrium problems
- Optimality of global proper efficiency for cone-arcwise connected set-valued optimization using contingent epiderivative
- A Lagrange multiplier theorem and a sandwich theorem for convex relations.
- Multivalued convexity and optimization: A unified approach to inequality and equality constraints
- Optimality criteria in set-valued optimization
- Variational Analysis and Applications
- Convex Analysis and Beyond
- OPTIMIZATION PROBLEMS WITH DIFFERENCE OF SET-VALUED MAPS UNDER GENERALIZED CONE CONVEXITY
- Set-valued analysis
- Simplified optimality conditions for minimizing the difference of vector-valued functions
- Global proper efficiency and vector optimization with cone-arcwise connected set-valued maps
- On constrained set-valued optimization problems with \(\rho\)-cone arcwise connectedness
- SET-VALUED OPTIMIZATION PROBLEMS WITH (p, r)-ρ -CONE ARCWISE CONNECTEDNESS
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)