On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives

DOI10.1007/s11590-018-1292-4zbMath1437.90144OpenAlexW2809728774WikidataQ129491104 ScholiaQ129491104MaRDI QIDQ2311119

Do Sang Kim, Guang-Ri Piao, Zhe Hong

Publication date: 10 July 2019

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-018-1292-4

zbMATH Keywords

KKT optimality conditionsWolfe duality\(C\)-convexityweakly \(C-\epsilon\)-efficient solution

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Related Items

A note on approximate proper efficiency in linear fractional vector optimization ⋮ Optimality Conditions for Approximate Pareto Minimality ⋮ On approximate optimality conditions for robust multi-objective convex optimization problems ⋮ A characterization of the $\varepsilon$-normal set and its application in robust convex optimization problems ⋮ Unnamed Item ⋮ On a weakly C-$\epsilon$-vector saddle point approach in weak vector problems

Cites Work

• Approximate solutions of multiobjective optimization problems
• \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
• Optimality conditions and duality in nonsmooth multiobjective optimization problems
• Generating \(\varepsilon\)-efficient solutions in multiobjective programming
• Generalized Motzkin theorems of the alternative and vector optimization problems
• \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
• \(\epsilon\)-solutions in vector minimization problems
• Epsilon efficiency
• Stability results for approximately efficient solutions
• Epsilon approximate solutions for multiobjective programming problems
• \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
• ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
• Introduction to the Theory of Nonlinear Optimization
• ε-Optimal solutions in nondifferentiable convex programming and some related questions
• On Approximate Solutions in Convex Vector Optimization
• On the Subdifferentiability of Convex Functions
• Convex Analysis
• Approximately Efficient Solutions in Vector Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item