Optimality conditions for D.C. vector optimization problems under reverse convex constraints
From MaRDI portal
Recommendations
- Optimality conditions for DC programming problems with reverse convex constraints
- Reverse convex problems: an approach based on optimality conditions
- scientific article; zbMATH DE number 6005913
- Necessary and sufficient optimality conditions for D. C. vector optimization
- Optimality conditions for vector optimization problems of a difference of convex mappings
Cites work
- scientific article; zbMATH DE number 16313 (Why is no real title available?)
- scientific article; zbMATH DE number 1328991 (Why is no real title available?)
- scientific article; zbMATH DE number 3352257 (Why is no real title available?)
- A characterization of proper minimal points as solutions of sublinear optimization problems
- A formula on the approximate subdifferential of the difference of convex functions
- Duality for anticonvex programs.
- Duality in D. C. programming: The case of several D. C. constraints
- Duality in Reverse Convex Optimization
- Global Optimality Criterion and a Duality with a Zero Gap in Nonconvex Optimization
- Kolmogorov conditions for vectorial optimization problems
- On Lagrance-Kuhn-Tucker Mulitipliers for Muliobjective Optimization Problems
- On lagrange-kuhn-tucker multipliers for pareto optimization problems
- Optimization and nonsmooth analysis
- Semi-continuous mappings in general topology
- Simplified optimality conditions for minimizing the difference of vector-valued functions
- Sufficient optimality condition for vector optimization problems under D.C. data
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
Cited in
(20)- Characterizing strict efficiency for convex multiobjective programming problems
- Strict vector variational inequalities and strict Pareto efficiency in nonconvex vector optimization
- Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions
- Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels
- Duality and optimality conditions for reverse convex programs via a convex decomposition
- Subdifferential and optimality conditions for the difference of set-valued mappings
- Focus on sufficient optimality conditions in D.C. vector optimization
- Beyond canonical dc-optimization: the single reverse polar problem
- Optimality conditions for minimizing the difference of nonconvex vector-valued mappings
- Necessary and sufficient optimality conditions for D. C. vector optimization
- On the optimality conditions for D.C. vector optimization problems
- Optimality conditions for DC programming problems with reverse convex constraints
- Cone arcwise connectivity in optimization problems with difference of set-valued mappings
- Necessary optimality conditions of a D.C. set-valued bilevel optimization problem
- On the reciprocal vector optimization problems
- Calculus of tangent sets and derivatives of set-valued maps under metric subregularity conditions
- Reverse convex problems: an approach based on optimality conditions
- Necessary optimality conditions for vector reverse convex minimization problems via a conjugate duality
- scientific article; zbMATH DE number 6005913 (Why is no real title available?)
- Optimality conditions for vector optimization problems with difference of convex maps
This page was built for publication: Optimality conditions for D.C. vector optimization problems under reverse convex constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q816065)
