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

References

• Kuhn HW, Tucker AW. Nonlinear programming. In: Neyman J, editor. Berkeley Symposium on Mathematical Statistics and Probability. Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability. Berkeley: University of California Press; 1951. p. 481–492.
   Google Scholar
• Benson HP, Morin TL. The vector maximization problem: proper efficiency and stability. SIAM J Appl Math. 1977;32:64–72.
   Web of Science ®Google Scholar
• Borwein JM. Proper efficient points for maximizations with respect to cones. SIAM J Control Optim. 1977;15:57–63.
   Web of Science ®Google Scholar
• Benson HP. An improved definition of proper efficiency for vector maximization with respect to cones. J Math Anal Appl. 1979;71:232–241.
   Web of Science ®Google Scholar
• Borwein JM. The geometry of Pareto efficiency over cones. Math Oper sch Stat Ser Optim. 1980;11:235–248.
   Google Scholar
• Borwein JM. On the existence of Pareto efficient points. Math Oper Res. 1983;8:64–73.
   Web of Science ®Google Scholar
• Lin LJ. Optimization of set-valued functions. J Math Anal Appl. 1994;186:30–51.
   Web of Science ®Google Scholar
• Edgeworth FY. Mathematical psychics. London: Kegan Paul; 1881.
   Google Scholar
• Pareto V. Manuale di economia politica. Milano (Italy): Societa Editrice Libraria; 1906. English translation: Pareto V. Manual of political economy. Translated by Schwier AS, Augustus M. New York (NY): Kelley Publishers; 1971.
   Google Scholar
• Stadler W, editor. Multicriteria optimization in engineering and in the sciences. New York (NY): Plenum Press; 1988.
   Google Scholar
• Ansari GH, Yao G. Recent developments in vector optimization. New York (NY): Springer; 2012.
   Google Scholar
• Hiriart-Urruty JB. From convex optimization to nonconvex optimization. In: Clarke FH, Demyanov VF, Giannessi F, editors. Nonsmooth optimization and related topics. Plenum (NY): Plenum Press; 1989. p. 219–239.
   Google Scholar
• Chen GY, Jahn J. Optimality conditions for set-valued optimization problems. Math Methods Oper Res. 1998;48:187–200.
   Web of Science ®Google Scholar
• Farajzadeh A, Cheraghi P. On optimality conditions via weak subdifferential and augmented normal cone. Iran J Oper Res. 2018;9(2):15–30.
   Google Scholar
• Flores-Bazan F, Oettli W. Simplified optimality conditions for minimizing the difference of vector valued functions. J Optim Theory Appl. 2001;108:571–586.
   Web of Science ®Google Scholar
• Khazayel B, Farajzadeh A. New vectorial versions of Takahashis nonconvex minimization problem. Optim Lett. 2019. doi:https://doi.org/10.1007/s11590-019-01521-x
   PubMed Web of Science ®Google Scholar
• Luu DV. Higher-order necessary and sufficient conditions for strict local Pareto minima in terms of Studniarskis derivatives. Optimization. 2008;57:593–605.
   Web of Science ®Google Scholar
• Liu JC, Yokoyama K. ϵ-optimality and duality for fractional programming. Taiwan J Math. 1999;3:311–322.
   Web of Science ®Google Scholar
• Taa A. ϵ-subdifferentials of set-valued maps and ϵ-weak Pareto optimality for multiobjective optimization. Math Methods Oper Res. 2005;62:187–209.
   Web of Science ®Google Scholar
• Kim GS, Lee GM. On ϵ-approximate solutions for convex semidefinite optimization problems. Taiwan J Math. 2007;11:765–784.
   Web of Science ®Google Scholar
• Bot RI, Hodrea IB, Wanka G. ϵ-optimality conditions for composed convex optimization problems. J Approx Theory. 2008;153:108–121.
   Web of Science ®Google Scholar
• Durea M, Dutta J, Tammer C. Lagrange multipliers for ϵ-Pareto solutions in vector optimization with nonsolid cones in Banach spaces. J Optim Theory Appl. 2010;145:196–211.
   Web of Science ®Google Scholar
• Martinez-Legaz JE, Seeger A. A formula on the approximate subdifferential of the difference of convex functions. Bull Aust Math Soc. 1992;45:37–41.
   Web of Science ®Google Scholar
• Gadhi N, Metrane A. Sufficient optimality condition for vector optimization problems under D.C. date. J Global Optim. 2004;28:55–66.
   Web of Science ®Google Scholar
• Laghdir M. Optimality conditions in DC constrained optimization. Acta Math Vietnam. 2005;30(2):169–179.
   Google Scholar
• Gadhi N. Optimality conditions for the difference of convex set-valued mappings. Positivity. 2005;9(4):687–703.
   Web of Science ®Google Scholar
• Gadhi N, Laghdir M, Metrane A. Optimality conditions for D.C vector optimization problems under reverse convex constraints. J Global Optim. 2005;33:527–540.
   Web of Science ®Google Scholar
• Amahroq T, Penot JP, Syam A. On the subdifferentiability of the difference of two functions and local minimization. Set-Valued Anal. 2008;16(4):413–427.
   Google Scholar
• Bot RI, Nechita D. On the Dini-Hadamard subdifferential of the difference of two functions. J Global Optim. 2011;50:485–502.
   Web of Science ®Google Scholar
• Boyd S. Convex optimization. New York: Cambridge University Press; 2004.
   Google Scholar
• Penot JP. The directional subdifferential of the difference of two convex functions. J Global Optim. 2011;49:505–519.
   Web of Science ®Google Scholar
• Guo XL, Li SJ. Optimality conditions for vector optimization problems with difference of convex maps. J Optim Theory Appl. 2014;162:821–844.
   Web of Science ®Google Scholar
• Zowe J. Subdifferentiability of convex functions with values in an ordered vector space. Math Scand. 1974;34:69–83.
   Web of Science ®Google Scholar
• Michelot C. Caractérisation des minima locaux des fonctions de la classe D.C. Université de Dijon; 1987.
   Google Scholar
• Jahn J. Vector optimization: theory applications, and extensions. Berlin: Springer; 2004.
   Google Scholar