## Abstract and Applied Analysis

### A Note on Optimality Conditions for DC Programs Involving Composite Functions

#### Abstract

By using the formula of the ε-subdifferential for the sum of a convex function with a composition of convex functions, some necessary and sufficient optimality conditions for a DC programming problem involving a composite function are obtained. As applications, a composed convex optimization problem, a DC optimization problem, and a convex optimization problem with a linear operator are examined at the end of this paper.

#### Article information

Source
Abstr. Appl. Anal., Volume 2014, Special Issue (2014), Article ID 203467, 6 pages.

Dates
First available in Project Euclid: 6 October 2014

https://projecteuclid.org/euclid.aaa/1412606026

Digital Object Identifier
doi:10.1155/2014/203467

Mathematical Reviews number (MathSciNet)
MR3216036

Zentralblatt MATH identifier
07021920

#### Citation

Sun, Xiang-Kai; Fu, Hong-Yong. A Note on Optimality Conditions for DC Programs Involving Composite Functions. Abstr. Appl. Anal. 2014, Special Issue (2014), Article ID 203467, 6 pages. doi:10.1155/2014/203467. https://projecteuclid.org/euclid.aaa/1412606026

#### References

• R. Horst and N. V. Thoai, “DC programming: overview,” Journal of Optimization Theory and Applications, vol. 103, no. 1, pp. 1–43, 1999.
• M. Laghdir, “Optimality conditions and Toland's duality for a nonconvex minimization problem,” Matematichki Vesnik, vol. 55, no. 1-2, pp. 21–30, 2003.
• R. I. Boţ, S.-M. Grad, and G. Wanka, “Generalized Moreau-Rockafellar results for composed convex functions,” Optimization, vol. 58, no. 7, pp. 917–933, 2009.
• D. H. Fang, C. Li, and K. F. Ng, “Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming,” SIAM Journal on Optimization, vol. 20, no. 3, pp. 1311–1332, 2009.
• R. I. Boţ, Conjugate Duality in Convex Optimization, Springer, Berlin, Germany, 2010.
• N. Dinh, T. T. A. Nghia, and G. Vallet, “A closedness condition and its applications to DC programs with convex constraints,” Optimization, vol. 59, no. 3-4, pp. 541–560, 2010.
• D. H. Fang, C. Li, and X. Q. Yang, “Stable and total Fenchel duality for DC optimization problems in locally convex spaces,” SIAM Journal on Optimization, vol. 21, no. 3, pp. 730–760, 2011.
• D. H. Fang, C. Li, and X. Q. Yang, “Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces,” Nonlinear Analysis: Theory, Methods & Applications, vol. 75, no. 8, pp. 3672–3681, 2012.
• D. H. Fang, G. M. Lee, C. Li, and J. C. Yao, “Extended Farkas's lemmas and strong Lagrange dualities for DC infinite programming,” Journal of Nonlinear and Convex Analysis, vol. 14, no. 4, pp. 747–767, 2013.
• X. K. Sun and S. J. Li, “Duality and Farkas-type results for extended Ky Fan inequalities with DC functions,” Optimization Letters, vol. 7, no. 3, pp. 499–510, 2013.
• X.-K. Sun, S.-J. Li, and D. Zhao, “Duality and Farkas-type results for DC infinite programming with inequality constraints,” Taiwanese Journal of Mathematics, vol. 17, no. 4, pp. 1227–1244, 2013.
• X.-K. Sun, “Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming,” Journal of Mathematical Analysis and Applications, vol. 414, no. 2, pp. 590–611, 2014.
• L. Thibault, “Sequential convex subdifferential calculus and sequential Lagrange multipliers,” SIAM Journal on Control and Optimization, vol. 35, no. 4, pp. 1434–1444, 1997.
• V. Jeyakumar, G. M. Lee, and N. Dinh, “New sequential Lagrange multiplier conditions characterizing optimality without constraint qualification for convex programs,” SIAM Journal on Optimization, vol. 14, no. 2, pp. 534–547, 2003.
• V. Jeyakumar, Z. Y. Wu, G. M. Lee, and N. Dinh, “Liberating the subgradient optimality conditions from constraint qualifications,” Journal of Global Optimization, vol. 36, no. 1, pp. 127–137, 2006.
• R. I. Boţ, E. R. Csetnek, and G. Wanka, “Sequential optimality conditions for composed convex optimization problems,” Journal of Mathematical Analysis and Applications, vol. 342, no. 2, pp. 1015–1025, 2008.
• F. S. Bai, Z. Y. Wu, and D. L. Zhu, “Sequential Lagrange multiplier condition for $\epsilon$-optimal solution in convex programming,” Optimization, vol. 57, no. 5, pp. 669–680, 2008.
• R. I. Boţ, I. B. Hodrea, and G. Wanka, “$\epsilon$-optimality conditions for composed convex optimization problems,” Journal of Approximation Theory, vol. 153, no. 1, pp. 108–121, 2008.
• N. Dinh, B. S. Mordukhovich, and T. T. A. Nghia, “Qualification and optimality conditions for DC programs with infinite constraints,” Acta Mathematica Vietnamica, vol. 34, no. 1, pp. 123–153, 2009.
• N. Dinh, J. J. Strodiot, and V. H. Nguyen, “Duality and optimality conditions for generalized equilibrium problems involving DC functions,” Journal of Global Optimization, vol. 48, no. 2, pp. 183–208, 2010.
• G. S. Kim and G. M. Lee, “On $\epsilon$-optimality theorems for convex vector optimization problems,” Journal of Nonlinear and Convex Analysis, vol. 12, no. 3, pp. 473–482, 2011.
• G. M. Lee, G. S. Kim, and N. Dinh, “Optimality conditions for approximate solutions of convex semi-infinite vector optimization problems,” in Recent Developments in Vector Optimization, Vector Optimization, Q. H. Ansari and J. C. Yao, Eds., vol. 1, pp. 275–295, Springer, Berlin, Germany, 2012.
• X. L. Guo, S. J. Li, and K. L. Teo, “Subdifferential and optimality conditions for the difference of set-valued mappings,” Positivity, vol. 16, no. 2, pp. 321–337, 2012.
• X. L. Guo and S. J. Li, “Optimality conditions for vector optimization problems with difference of convex maps,” Journal of Optimization Theory and Applications, 2013.
• D. H. Fang and X. P. Zhao, “Local and global optimality conditions for DC infinite optimization problems,” Taiwanese Journal of Mathematics, 2013.
• J. B. Hiriart-Urruty, “From convex optimization to nonconvex optimization necessary and sufficient conditions for global optimality,” in From Convexity to Nonconvexity, R. P. Gilbert, P. D. Panagiotopoulos, and P. M. Pardalos, Eds., pp. 219–239, Kluwer, London, UK, 2001. \endinput