New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions

References

• Boţ RI, Csetnek ER, Wanka G. Regularity conditions via quasi-relative interior in convex programming. SIAM J Optim. 2008;19:217–233. doi: 10.1137/07068432X
   Web of Science ®Google Scholar
• Boţ RI, Grad SM, Wanka G. A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces. Math Nachr. 2008;281:1088–1107. doi: 10.1002/mana.200510662
   Web of Science ®Google Scholar
• Boţ RI, Grad SM, Wanka G. Generalized Moreau-Rockafellar results for composed convex functions. Optimization. 2009;58:917–933. doi: 10.1080/02331930902945082
   Web of Science ®Google Scholar
• Boţ RI, Wanka G. A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces. Nonlinear Anal. 2006;64:2787–2804. doi: 10.1016/j.na.2005.09.017
   Web of Science ®Google Scholar
• Dinh N, Vallet G, Volle M. Functional inequalities and theorems of the alternative involving composite functions. J Global Optim. 2014;59:837–863. doi: 10.1007/s10898-013-0100-z
   Web of Science ®Google Scholar
• Fang DH, Ansari QH, Zhao XP. Constraint qualifications and zero duality gap properties in conical programming involving composite functions. J Nonlinear Convex Anal. 2018;19:53–69.
   Web of Science ®Google Scholar
• Fang DH, Köbis E, Zhao XP. Zero duality gap property for convex composite optimization problems. J Nonlinear Convex Anal. 2018;19:2219–2233.
   Web of Science ®Google Scholar
• Fang DH, Wang XY. Stable and total Fenchel duality for composed convex optimization problems. Acta Math Appl Sinica. 2018;34:813–827. doi: 10.1007/s10255-018-0793-3
   Web of Science ®Google Scholar
• Fang DH, Li C, Yang XQ. Stable and total Fenchel duality for DC optimization problems in locally convex spaces. SIAM J Optim. 2011;21:730–760. doi: 10.1137/100789749
   Web of Science ®Google Scholar
• Fang DH, Li C, Yang XQ. Asymptotic cloure condition and Fenchel duality for DC optimization problems in locally convex spaces. Nonlinear Anal. 2012;75:3672–3681. doi: 10.1016/j.na.2012.01.023
   Web of Science ®Google Scholar
• Li C, Fang DH, López G, et al. Stable and total Fenchel duality for convex optimization problems in locally convex spaces. SIAM J Optim. 2009;20:1032–1051. doi: 10.1137/080734352
   Web of Science ®Google Scholar
• Li C, Zhao XP, Hu YH. Quasi-Slater and Farkas-Minkowski qualifications for semi-infinite programming with applications. SIAM J Optim. 2013;23:2208–2230. doi: 10.1137/130911287
   Web of Science ®Google Scholar
• Long XJ, Sun XK, Peng ZY. Approximate optimality conditions for composite convex optimization problems. J Oper Res Soc China. 2017;5:469–485. doi: 10.1007/s40305-016-0140-4
   Web of Science ®Google Scholar
• Rockafellar RT. Conjugate duality and optimization. In: Conference board of the mathematical sciences regional conference series in applied mathematics 16. Philadelphia: SIAM; 1974.
   Google Scholar
• Sun XK, Long XJ, Zeng J. Constraint qualifications characterizing Fenchel duality in composed convex optimization. J Nonlinear Convex Anal. 2016;17:325–347.
   Web of Science ®Google Scholar
• Zlinescu C. Convex analysis in general vector spaces. New Jersey: World Scientific; 2002.
   Google Scholar
• Zhao XP. Constraint qualification for quasiconvex inequality system with applications in constraint optimization. J Nonlinear Convex Anal. 2016;17:879–889.
   Web of Science ®Google Scholar
• Zhou YY, Li G. The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions. Numer Algebra Control Optim. 2014;4:9–23. doi: 10.3934/naco.2014.4.9
   Google Scholar
• An LTH, Tao PD. The DC (difference of convex functions) programming and DCA revisited with DC models of real world non-convex optimization problems. Ann Oper Res. 2005;133:23–46. doi: 10.1007/s10479-004-5022-1
   Web of Science ®Google Scholar
• An LTH, Dinh TP. DC programming and DCA: thirty years of developments. Math Program Ser B. 2018;169:5–68. doi: 10.1007/s10107-018-1235-y
   Web of Science ®Google Scholar
• Dinh N, Mordukhovich BS, Nghia TTA. Qualification and optimality conditions for convex and DC programs with infinite constraints. Acta Math Vietnamica. 2009;34:125–155.
   Google Scholar
• Dinh N, Mordukhovich BS, Nghia TTA. Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs. Math Program. 2010;123:101–138. doi: 10.1007/s10107-009-0323-4
   Web of Science ®Google Scholar
• Dinh N, Nghia TTA, Vallet G. A closedness condition and its applications to DC programs with convex constraints. Optim. 2010;59:541–560. doi: 10.1080/02331930801951348
   Web of Science ®Google Scholar
• Dinh N, Vallet G, Nghia TTA. Farkas-type results and duality for DC programs with convex constraints. J Convex Anal. 2008;15:235–262.
   Web of Science ®Google Scholar
• Fang DH, Zhang Y. Extended Farkas's lemmas and strong dualities for conic programming involving composite functions. J Optim Theory Appl. 2018;176:351–376. doi: 10.1007/s10957-018-1219-3
   Web of Science ®Google Scholar
• Fang DH, Zhao XP. Local and global optimality conditions for DC infinite optimization problems. Taiwanese J Math. 2014;18:817–834. doi: 10.11650/tjm.18.2014.3888
   Web of Science ®Google Scholar
• Horst R, Thoai NV. DC programming: overview. J Optim Theory Appl. 1999;103:1–43. doi: 10.1023/A:1021765131316
   Web of Science ®Google Scholar
• Martinez-Legaz JE, Volle M. Duality in DC programming: the case of several constraints. J Math Anal Appl. 1999;237:657–671. doi: 10.1006/jmaa.1999.6496
   Web of Science ®Google Scholar
• Saeki Y, Kuroiwa D. Optimality conditions for DC programming problems with reverse convex constraints. Nonlinear Anal. 2013;80:18–27. doi: 10.1016/j.na.2012.11.025
   Web of Science ®Google Scholar
• Sun X. Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming. J Math Anal Appl. 2014;414:590–611. doi: 10.1016/j.jmaa.2014.01.033
   Web of Science ®Google Scholar
• Fang DH, Yang T, Wang XY. Stable and total Fenchel dualities for DC composite optimization problems in locally convex spaces. J Nonlinear Convex Anal. 2020;21:319–339.
   Web of Science ®Google Scholar
• Li C, Ng KF, Pong TK. The SECQ, linear regularity and the strong CHIP for infinite system of closed convex sets in normed linear spaces. SIAM J Optim. 2007;18:643–665. doi: 10.1137/060652087
   Web of Science ®Google Scholar
• Gowda MS, Teboulle M. A comparison of constraint qualifications in infinite dimensional convex programming. SIAM J Control Optim. 1990;28:925–935. doi: 10.1137/0328051
   Web of Science ®Google Scholar
• Fang DH, Lee GM, Li C, et al. Extended Farkas's lemmas and strong Lagrange dualities for DC infinite programming. J Nonlinear Convex Anal. 2013;14:747–767.
   Web of Science ®Google Scholar
• Sun XK, Li SJ, Zhao D. Duality and Farkas-type results for DC infinite programming with inequality constraints. Taiwanese J Math. 2013;17:1227–1244. doi: 10.11650/tjm.17.2013.2675
   Web of Science ®Google Scholar