On the optimality conditions for D.C. vector optimization problems
From MaRDI portal
(Redirected from On the optimality conditions for D.C. vector optimization problems)
Recommendations
- Optimality conditions for vector optimization problems with difference of convex maps
- Necessary and sufficient optimality conditions for D. C. vector optimization
- A note on the paper ``Optimality conditions for vector optimization problems with difference of convex maps
- scientific article; zbMATH DE number 6005913
- (-)efficiency in difference vector optimization
Cites work
- \(\epsilon\)-formality and duality for fractional programming
- -optimality conditions for composed convex optimization problems
- \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization
- A formula on the approximate subdifferential of the difference of convex functions
- An improved definition of proper efficiency for vector maximization with respect to cones
- Higher-order necessary and sufficient conditions for strict local pareto minima in terms of Studniarski's derivatives
- scientific article; zbMATH DE number 16313 (Why is no real title available?)
- scientific article; zbMATH DE number 2063780 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3067835 (Why is no real title available?)
- Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
- Multicriteria optimization in engineering and in the sciences
- New vectorial versions of Takahashi's nonconvex minimization problem
- On \(\varepsilon\)-approximate solutions for convex semidefinite optimization problems
- On the Dini-Hadamard subdifferential of the difference of two functions
- On the Existence of Pareto Efficient Points
- 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 for vector optimization problems with difference of convex maps
- Optimality conditions in DC-constrained optimization
- Optimization of set-valued functions
- Proper Efficient Points for Maximizations with Respect to Cones
- Recent Developments in Vector 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
- The geometry of Pareto efficiency over cones
- The Vector Maximization Problem: Proper Efficiency and Stability
Cited in
(8)- A note on the paper ``Optimality conditions for vector optimization problems with difference of convex maps
- (-)efficiency in difference vector optimization
- scientific article; zbMATH DE number 6005913 (Why is no real title available?)
- On a DC-optimization-problem from statistical factor analysis
- Necessary and sufficient optimality conditions for D. C. vector optimization
- Optimality conditions for vector optimization problems with difference of convex maps
- Focus on sufficient optimality conditions in D.C. vector optimization
- Optimality conditions for -weak local quasi-efficient solutions of D.C. vector optimization problems
This page was built for publication: On the optimality conditions for D.C. vector optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090295)
