Optimality conditions for vector optimization problems of a difference of convex mappings
From MaRDI portal
Publication:813348
DOI10.1007/s10898-004-6874-2zbMath1101.90064OpenAlexW1999589200MaRDI QIDQ813348
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
Lagrange multipliersVector optimizationOptimality conditionsDifference of convex mappingsFractional mathematical programming
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items (9)
Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints ⋮ Optimality conditions for the difference of convex set-valued mappings ⋮ Subdifferential and optimality conditions for the difference of set-valued mappings ⋮ Characterizing strict efficiency for convex multiobjective programming problems ⋮ The directional subdifferential of the difference of two convex functions ⋮ Optimality conditions for minimizing the difference of nonconvex vector-valued mappings ⋮ Necessary optimality conditions of a D.C. set-valued bilevel optimization problem ⋮ (\(\epsilon\)-)efficiency in difference vector optimization ⋮ Strict vector variational inequalities and strict Pareto efficiency in nonconvex vector optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Fundamental theorems of nondominated solutions associated with cones in normed linear spaces
- Pshenichnyi's theorem for vector minimization
- Weak Pareto optimality of multiobjective problems in a locally convex linear topological space
- Necessary conditions for optimality of nondifferentiable convex multiobjective programming
- Generalizations of Slater's constraint qualification for infinite convex programs
- Optimality conditions for vector mathematical programming via a theorem of the alternative
- A characterization of proper minimal points as solutions of sublinear optimization problems
- Cone extremal solutions of multi-payoff games with cross-constrained strategy sets
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- On lagrange-kuhn-tucker multipliers for pareto optimization problems
- On Lagrance-Kuhn-Tucker Mulitipliers for Muliobjective Optimization Problems
- Conjugate functions and subdifferentials in nonnormed situations for operators with complete graphs
- Convex Analysis
This page was built for publication: Optimality conditions for vector optimization problems of a difference of convex mappings
