Stable Strong Duality for Composed Optimization Problems with Composed Constraints

Hồng Mơ Trần1, , Hai Long Dang2
1 Trường Đại học Mở Thành phố Hồ Chí Minh
2 Trường Đại học Bách Khoa, ĐHQG TP. HCM

Main Article Content

Abstract

This paper is devoted to the study of stable strong duality for composed convex optimization problems with composed constraints. To this end, we establish generalized Farkas-type results and provide characterizations for inequality systems involving composed convex functions under composed constraints. These results extend several existing results in convex and nonconvex programming. In particular, we introduce a sufficient condition ensuring generalized Farkas-type results in the composite setting. The obtained results are then applied to derive strong and stable strong duality for composed convex optimization problems with composed constraints, as well as optimality conditions for the aforementioned problem. As illustrations of the results, we present some consequences and applications to special cases.

Article Details

References

Bot, R. I. (2010), Conjugate Duality in Convex Optimization. Springer-Verlag, Berlin/Heidelberg.
Bot, R. I. et al. (2006a). Farkas-type results for inequality systems with composed convex functions via conjugate duality, J. Math. Anal. Appl. 322, no. 1, 316–328.
Bot, R. I. et al. (2006b). Composed convex programming: duality and Farkas-type results, In Z. Kasa, G. Kassay, J. Kolumban (Eds.), Proceedings of the International Conference In Memoriam Gyula Farkas, Cluj University Press, 22–35.
Bot, R. I. et al. (2006c). A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces, Nonlinear Anal. 64, no. 12, 2787–2804.
Bot, R. I. et al. (2009). Generalized Moreau-Rockafellar results for composed convex functions, Optimization 58, no. 7, 917–933.
Bot, R. I. et al. (2003). Duality for composed convex functions with applications in location theory, In: Habenicht, W., Scheubrein, B., Scheubrein, R. (eds) Multi-Criteria- und Fuzzy-Systeme in Theorie und Praxis. Deutscher Universitätsverlag, 1–18.
Dinh, N. et al. (2012). Qualification conditions and Farkas-type results for systems involving composite functions, Vietnam J. Math. 40, no. 4, 407–437.
Dinh, N. et al. (2008). Farkas-type results and duality for DC programs with convex constraints, J. Convex Anal. 15, no. 2, 235–262.
Dinh, N. et al. (2010). A closedness condition and its applications to DC programs with convex constraints, Optimization 59, no. 4, 541–-560.
Dinh, N. et al. (2014). Functional inequalities and theorems of the alternative involving composite functions, J. Glob. Optim. 59, no. 4, 837–863.
Feizollahi, M. J. et al. (2017). Exact augmented Lagrangian duality for mixed integer linear programming, Math. Program. 161, 365–387.
Hodrea, I. B. (2007). Farkas - type results for convex and non - convex inequality systems, Diss., 1–113.
Huang, X. X. et al. (2003). A unified augmented Lagrangian approach to duality and exact penalization, Math. Oper. Res. 28, no. 3, 533–552.
Jeyakumar, V. et al. (2009). Stable zero duality gaps in convex programming: Complete dual characterizations with application to semidefinite programs, J. Math. Anal. Appl. 360, no. 1, 156–167.
Li, D. (1995). Zero duality gap for a class of nonconvex optimization problems, J. Optim. Theory Appl. 85, no. 2, 309–324.
Li., G. (2008), On extension of Fenchel duality and its application, SIAM J. Optim. 19, no. 3, 1489–1509.
Long, X. J. et al. (2010), Farkas-type results for general composed convex optimization problems with inequality constraints, Math. Inequal. Appl. 13, no. 1, 135–143.
Rudin, W. (1991). Functional Analysis, 2nd edition; McGraw-Hill, New York.
Toland, J. F. (1978). Duality in non-convex optimization, J. Math. Anal. Appl. 66, no. 2, 399–415
Zalinescu, C. (2002). Convex Analysis in General Vector Spaces, World Scientific, River Edge, NJ.