Necessary optimality conditions for vector reverse convex minimization problems via a conjugate duality

DOI10.1007/s10013-022-00602-2OpenAlexW4313908350MaRDI QIDQ6189128

Houda Keraoui, Abdelmalek Aboussoror

Publication date: 12 January 2024

Published in: Vietnam Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10013-022-00602-2

zbMATH Keywords

reverse convex programmingoptimality conditionsmultiobjective programmingconvex programming

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Optimality conditions for D.C. vector optimization problems under reverse convex constraints
• Duality for multiobjective optimization problems with convex objective functions and D.C. constraints
• Strong duality for generalized convex optimization problems
• Duality for almost convex optimization problems via the perturbation approach
• Conjugate duality in convex optimization
• Convex programs with an additional reverse convex constraint
• Conditions for global optimality. II
• Duality in D. C. programming: The case of several D. C. constraints
• Sufficient optimality condition for vector optimization problems under D.C. data
• Fenchel-Lagrange duality versus geometric duality in convex optimization
• Proper efficiency and the theory of vector maximization
• Inf-convolution, sous-additivite, convexite des fonctions numériques
• Stable strong Fenchel and Lagrange duality for evenly convex optimization problems
• Duality in Vector Optimization
• Convex Analysis

This page was built for publication: Necessary optimality conditions for vector reverse convex minimization problems via a conjugate duality