Optimality conditions for vector optimization problems of a difference of convex mappings
DOI10.1007/S10898-004-6874-2zbMATH Open1101.90064OpenAlexW1999589200MaRDI QIDQ813348FDOQ813348
Authors: Ahmed Taa 
Publication date: 8 February 2006
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-004-6874-2
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
Lagrange multipliersVector optimizationOptimality conditionsDifference of convex mappingsFractional mathematical programming
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Convex Analysis
- Title not available (Why is that?)
- Necessary conditions for optimality of nondifferentiable convex multiobjective programming
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- On lagrange-kuhn-tucker multipliers for pareto optimization problems
- Generalizations of Slater's constraint qualification for infinite convex programs
- On Lagrance-Kuhn-Tucker Mulitipliers for Muliobjective Optimization Problems
- Optimality conditions for vector mathematical programming via a theorem of the alternative
- Title not available (Why is that?)
- 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
- Weak Pareto optimality of multiobjective problems in a locally convex linear topological space
- Pshenichnyi's theorem for vector minimization
- Fundamental theorems of nondominated solutions associated with cones in normed linear spaces
Cited In (21)
- Necessary and sufficient optimality conditions for D. C. vector optimization
- Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
- Strict vector variational inequalities and strict Pareto efficiency in nonconvex vector optimization
- The directional subdifferential of the difference of two convex functions
- Subdifferential and optimality conditions for the difference of set-valued mappings
- Title not available (Why is that?)
- Optimality conditions for D.C. vector optimization problems under reverse convex constraints
- Optimality conditions for vector optimization problems with difference of convex maps
- Optimality conditions for minimizing the difference of nonconvex vector-valued mappings
- Vector optimization problems with quasiconvex constraints
- Simplified optimality conditions for minimizing the difference of vector-valued functions
- Optimality conditions for the difference of convex set-valued mappings
- Duality principles for optimization problems dealing with the difference of vector-valued convex mappings
- Optimality conditions and image space analysis for vector optimization problems
- Characterizing strict efficiency for convex multiobjective programming problems
- Cone arcwise connectivity in optimization problems with difference of set-valued mappings
- Necessary optimality conditions of a D.C. set-valued bilevel optimization problem
- Regularity conditions in differentiable vector optimization revisited
- On characterizations of convex vector functions and optimization
- (\(\epsilon\)-)efficiency in difference vector optimization
- A note on the paper ``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)
