Abstract
To each type of efficiency for optimization problems it is possible to associate notions of conjugate and subdifferential for vector valued functions or set-valued maps. In this chapter we study the conjugate and the subdifferential corresponding to the strong efficiency as well as the subdifferentials corresponding to the weak and Henig type efficiencies. For the strong conjugate and subdifferential we establish similar results to those in the convex scalar case, while for the other types of subdifferential we establish formulas for the subdifferentials of the sum and the composition of functions and set-valued maps.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bourbaki, N.: Eléments de mathématique. XVIII. Première partie: Les structures fondamentales de l’analyse. Livre V: Espaces vectoriels topologiques. Chapitre III: Espaces d’applications linéaires continues. Chapitre IV: La dualité dans les espaces vectoriels topologiques. Chapitre V: Espaces hilbertiens. Actualités Sci. Ind., no. 1229. Hermann & Cie, Paris (1955)
Chen, G.Y., Huang, X., Yang, X.: Vector optimization. Lecture Notes in Economics and Mathematical Systems, vol. 541. Springer, Berlin (2005)
Chen, G.Y., Jahn, J.: Optimality conditions for set-valued optimization problems. Math. Methods Oper. Res. 48(2), 187–200 (1998)
Combari, C., Laghdir, M., Thibault, L.: Sous-différentiels de fonctions convexes composées. Ann. Sci. Math. Québec 18(2), 119–148 (1994)
El Maghri, M.: Pareto-Fenchel ε-subdifferential sum rule and ε-efficiency. Optim. Lett. 6(4), 763–781 (2012)
El Maghri, M., Laghdir, M.: Pareto subdifferential calculus for convex vector mappings and applications to vector optimization. SIAM J. Optim. 19(4), 1970–1994 (2008)
Kusraev, A.G., Kutateladze, S.S.: Subdifferentials: theory and applications. In: Mathematics and Its Applications, vol. 323. Kluwer Academic, Dordrecht (1995). Translated from the Russian
Laghdir, M.: Some remarks on subdifferentiability of convex functions. Appl. Math. E-Notes 5, 150–156 (electronic) (2005)
Li, T., Xu, Y.: The strictly efficient subgradient of set-valued optimisation. Bull. Aust. Math. Soc. 75(3), 361–371 (2007)
Lin, L.J.: Optimization of set-valued functions. J. Math. Anal. Appl. 186(1), 30–51 (1994)
Raffin, C.: Sur les programmes convexes définis dans des espaces vectoriels topologiques. Ann. Inst. Fourier (Grenoble) 20(fasc. 1), 457–491 (1970)
Silverman, R.J., Yen, T.: The Hahn-Banach theorem and the least upper bound property. Trans. Am. Math. Soc. 90, 523–526 (1959)
Song, W.: Conjugate duality in set-valued vector optimization. J. Math. Anal. Appl. 216(1), 265–283 (1997)
Song, W.: Characterizations of some remarkable classes of cones. J. Math. Anal. Appl. 279(1), 308–316 (2003)
Taa, A.: Subdifferentials of multifunctions and Lagrange multipliers for multiobjective optimization. J. Math. Anal. Appl. 283(2), 398–415 (2003)
Taa, A.: ε-subdifferentials of set-valued maps and ε-weak Pareto optimality for multiobjective optimization. Math. Methods Oper. Res. 62(2), 187–209 (2005)
Taa, A.: On subdifferential calculus for set-valued mappings and optimality conditions. Nonlinear Anal. 74(18), 7312–7324 (2011)
Tanino, T.: Conjugate duality in vector optimization. J. Math. Anal. Appl. 167(1), 84–97 (1992)
Tanino, T., Sawaragi, Y.: Conjugate maps and duality in multiobjective optimization. J. Optim. Theory Appl. 31(4), 473–499 (1980)
Ursescu, C.: Multifunctions with convex closed graph. Czechoslovak Math. J. 25(100)(3), 438–441 (1975)
Valadier, M.: Sous-différentiabilité de fonctions convexes à valeurs dans un espace vectoriel ordonné. Math. Scand. 30, 65–74 (1972)
Zălinescu, C.: The Fenchel–Rockafellar duality theory for mathematical programming in oreder-complete vector lattices and applications. Tech. Rep. 45, INCREST, Bucharest (1980)
Zălinescu, C.: Duality for vectorial nonconvex optimization by convexification and applications. An. Ştiinţ. Univ. Al. I. Cuza Iaşi Secţ. I a Mat. 29(3, suppl.), 15–34 (1983)
Zălinescu, C.: Optimality conditions in infinite dimensional convex programming (Romanian). Ph.D. thesis, University Alexandru Ioan Cuza Iasi, Iasi, Romania (1983)
Zălinescu, C.: Convex Analysis in General Vector Spaces. World Scientific, River Edge (2002)
Duality for vectorial convex optimization, conjugate operators and subdifferentials. The continuous case. Illmenau University, Eisenach (1984), Internationale Tagung Mathematische Optimierung – Theorie und Anwendungen
Zhou, Z.A., Yang, X.M., Peng, J.W.: ε-strict subdifferentials of set-valued maps and optimality conditions. Nonlinear Anal. 75(9), 3761–3775 (2012)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Khan, A.A., Tammer, C., Zălinescu, C. (2015). Conjugates and Subdifferentials. In: Set-valued Optimization. Vector Optimization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54265-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-54265-7_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-54264-0
Online ISBN: 978-3-642-54265-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)