On the optimality conditions for D.C. vector optimization problems

DOI10.1080/02331934.2020.1847109zbMath1495.90177OpenAlexW3110411377MaRDI QIDQ5090295

Publication date: 18 July 2022

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2020.1847109

zbMATH Keywords

optimality conditions subdifferential convex mapping minimal point local weak minimal solution

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Optimality conditions for vector optimization problems with difference of convex maps
On the Dini-Hadamard subdifferential of the difference of two functions
The directional subdifferential of the difference of two convex functions
Optimality conditions for D.C. vector optimization problems under reverse convex constraints
New vectorial versions of Takahashi's nonconvex minimization problem
Optimality conditions for the difference of convex set-valued mappings
\(\varepsilon\)-optimality conditions for composed convex optimization problems
Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
On the subdifferentiability of the difference of two functions and local minimization
Optimality conditions in DC-constrained optimization
An improved definition of proper efficiency for vector maximization with respect to cones
Optimality conditions for set-valued optimization problems
Optimization of set-valued functions
Sufficient optimality condition for vector optimization problems under D.C. data
Multicriteria optimization in engineering and in the sciences
\(\epsilon\)-formality and duality for fractional programming
On \(\varepsilon\)-approximate solutions for convex semidefinite optimization problems
\(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization
Recent Developments in Vector Optimization
Higher-order necessary and sufficient conditions for strict local pareto minima in terms of Studniarski's derivatives
The geometry of Pareto efficiency over cones
A formula on the approximate subdifferential of the difference of convex functions
The Vector Maximization Problem: Proper Efficiency and Stability
Proper Efficient Points for Maximizations with Respect to Cones
On the Existence of Pareto Efficient Points
Subdifferentiability of Convex Functions with Values in an Ordered Vector Space.
Simplified optimality conditions for minimizing the difference of vector-valued functions

This page was built for publication: On the optimality conditions for D.C. vector optimization problems