Optimality conditions for vector optimization problems with difference of convex maps
From MaRDI portal
(Redirected from Publication:463000)
Recommendations
- On the optimality conditions for D.C. vector optimization problems
- Optimality conditions for vector optimization problems of a difference of convex mappings
- (\(\epsilon\)-)efficiency in difference vector optimization
- Optimality conditions for minimizing the difference of nonconvex vector-valued mappings
- Necessary and sufficient optimality conditions for D. C. vector optimization
Cites work
- scientific article; zbMATH DE number 16313 (Why is no real title available?)
- Gap continuity of multimaps
- Higher order optimality conditions for Henig efficient solutions in set-valued optimization
- Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
- Nonconvex vector optimization of set-valued mappings.
- On subdifferentials of set-valued maps
- On the Dini-Hadamard subdifferential of the difference of two functions
- On the subdifferentiability of the difference of two functions and local minimization
- Optimality conditions for D.C. vector optimization problems under reverse convex constraints
- Optimality conditions for set-valued optimization problems
- Optimality conditions for the difference of convex set-valued mappings
- Optimality conditions in DC-constrained optimization
- Optimization of set-valued functions
- Pareto Subdifferential Calculus for Convex Vector Mappings and Applications to Vector Optimization
- Second-order optimality conditions for strict efficiency of constrained set-valued optimization
- Simplified optimality conditions for minimizing the difference of vector-valued functions
- Subdifferentiability of Convex Functions with Values in an Ordered Vector Space.
- Sufficient optimality condition for vector optimization problems under D.C. data
- The directional subdifferential of the difference of two convex functions
- \(\epsilon\)-formality and duality for fractional programming
- \(\varepsilon\)-optimality conditions for composed convex optimization problems
- \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization
Cited in
(17)- Simplified optimality conditions for minimizing the difference of vector-valued functions
- ON OPTIMALITY CONDITIONS FOR ABSTRACT CONVEX VECTOR OPTIMIZATION PROBLEMS
- A note on optimality conditions for DC programs involving composite functions
- Focus on sufficient optimality conditions in D.C. vector optimization
- Optimality conditions for vector optimization problems of a difference of convex mappings
- Optimality conditions for minimizing the difference of nonconvex vector-valued mappings
- Necessary and sufficient optimality conditions for D. C. vector optimization
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
- Regularity conditions in differentiable vector optimization revisited
- Some characterizations of robust optimal solutions for uncertain fractional optimization and applications
- (\(\epsilon\)-)efficiency in difference vector optimization
- On the optimality conditions for D.C. vector optimization problems
- A note on the paper ``Optimality conditions for vector optimization problems with difference of convex maps
- A modified proximal point method for DC functions on Hadamard manifolds
- Duality principles for optimization problems dealing with the difference of vector-valued convex mappings
- Bilevel optimization with a multiobjective problem in the lower level
- Optimality conditions for composite DC infinite programming problems
This page was built for publication: Optimality conditions for vector optimization problems with difference of convex maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463000)
