Optimality conditions for vector optimization problems of a difference of convex mappings
From MaRDI portal
(Redirected from Publication:813348)
Recommendations
- Optimality conditions for vector optimization problems with difference of convex maps
- Optimality conditions for minimizing the difference of nonconvex vector-valued mappings
- Optimality conditions for the difference of convex set-valued mappings
- scientific article; zbMATH DE number 4097143
- Publication:3211122
Cites work
- scientific article; zbMATH DE number 16313 (Why is no real title available?)
- scientific article; zbMATH DE number 3465097 (Why is no real title available?)
- A characterization of proper minimal points as solutions of sublinear optimization problems
- Cone extremal solutions of multi-payoff games with cross-constrained strategy sets
- Conjugate functions and subdifferentials in nonnormed situations for operators with complete graphs
- Convex Analysis
- Fundamental theorems of nondominated solutions associated with cones in normed linear spaces
- Generalizations of Slater's constraint qualification for infinite convex programs
- Necessary conditions for optimality of nondifferentiable convex multiobjective programming
- On Lagrance-Kuhn-Tucker Mulitipliers for Muliobjective Optimization Problems
- On lagrange-kuhn-tucker multipliers for pareto optimization problems
- Optimality conditions for vector mathematical programming via a theorem of the alternative
- Pshenichnyi's theorem for vector minimization
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Weak Pareto optimality of multiobjective problems in a locally convex linear topological space
Cited in
(21)- Characterizing strict efficiency for convex multiobjective programming problems
- Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
- Strict vector variational inequalities and strict Pareto efficiency in nonconvex vector optimization
- Optimality conditions and image space analysis for vector optimization problems
- Simplified optimality conditions for minimizing the difference of vector-valued functions
- Subdifferential and optimality conditions for the difference of set-valued mappings
- Optimality conditions for minimizing the difference of nonconvex vector-valued mappings
- Necessary and sufficient optimality conditions for D. C. vector optimization
- Regularity conditions in differentiable vector optimization revisited
- (\(\epsilon\)-)efficiency in difference vector optimization
- On characterizations of convex vector functions and optimization
- A note on the paper ``Optimality conditions for vector optimization problems with difference of convex maps
- Cone arcwise connectivity in optimization problems with difference of set-valued mappings
- Optimality conditions for the difference of convex set-valued mappings
- scientific article; zbMATH DE number 4097143 (Why is no real title available?)
- Necessary optimality conditions of a D.C. set-valued bilevel optimization problem
- The directional subdifferential of the difference of two convex functions
- Duality principles for optimization problems dealing with the difference of vector-valued convex mappings
- Vector optimization problems with quasiconvex constraints
- Optimality conditions for D.C. vector optimization problems under reverse convex constraints
- Optimality conditions for vector optimization problems with difference of convex maps
This page was built for publication: Optimality conditions for vector optimization problems of a difference of convex mappings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q813348)
