- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Recently Accepted Articles ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents
Abstract and Applied Analysis
Volume 2014 (2014), Article ID 203467, 6 pages
A Note on Optimality Conditions for DC Programs Involving Composite Functions
1College of Mathematics and Statistics, Chongqing Technology and Business University, Chongqing 400067, China
2College of Automation, Chongqing University, Chongqing 400030, China
3School of Management, Southwest University of Political Science and Law, Chongqing 401120, China
Received 23 April 2014; Accepted 22 May 2014; Published 29 May 2014
Academic Editor: Chong Li
Copyright © 2014 Xiang-Kai Sun and Hong-Yong Fu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
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.
Let and be two real locally convex Hausdorff topology vector spaces with their dual spaces and , endowed with the topologies and , respectively. Let be a nonempty closed convex cone which defined the partial order “” of ; namely, We attach an element which is the greatest element with respect to ” and let . Then, for any , one has and we define the following operations on : Let , and be proper, convex, and lower semicontinuous functions, and let be a proper, -convex, and star -lower semicontinuous function such that . Moreover, we assume that is a -increasing function; that is, In this paper, we deal with a new class of DC programming involving a composite function given in the following form: The problem is very general in the sense that it includes, as particular cases, many different problems as, for example, a composed convex optimization problem, a DC optimization problem, and a convex optimization problem with a linear operator; see [1–12] and the references therein. The interest of such a general problem is that it unifies all these particular problems in a convenient way. Moreover, many results obtained for one of these problems can be extended with suitable modifications to the problem .
Recently, optimality conditions for global or local minimizers of some special kinds of the problem have been studied by many researchers; see [13–25] and the references therein. Here, we specially mention the works on optimality defined via subdifferential calculus due to [18, 24, 25]. By using a formula for the -subdifferential of the sum of a convex function with a composition of convex functions, Boţ et al.  have obtained necessary and sufficient conditions for the -optimal solutions of composed convex optimization problems. By using some suitable conditions and the notions of strong subdifferential and epsilon-subdifferential, Guo and Li  obtained necessary and sufficient optimality conditions for an epsilon-weak Pareto minimal point and an epsilon-proper Pareto minimal point of a DC vector optimization problem. Fang and Zhao  introduced the local and global KKT type conditions for a DC optimization problem. Then, by using properties of the subdifferentials of the involved functions, they obtained some sufficient and/or necessary conditions for these two types of optimality conditions. The purpose of this paper is to establish optimality conditions for this optimization problem . To do that, by using the properties of the epigraph of the conjugate functions, we first introduce some closedness conditions and investigate some characterizations of these closedness conditions via the formula of the -subdifferential. Then, we obtain some necessary and sufficient optimality conditions. Moreover, at the end of this paper, we examine a composed convex optimization problem, a DC optimization problem, and a convex optimization problem with a linear operator.
The paper is organized as follows. In Section 2, we recall some notions and give some preliminary results. In Section 3, we obtain some optimality conditions for the problem in terms of the subdifferentials and the -subdifferentials of the functions. In Section 4, we give some special cases of our general results, which have been treated in the previous papers.
2. Mathematical Preliminaries
Throughout this paper, let and be two real locally convex Hausdorff topology vector spaces. Let be a set in ; the interior (resp., closure, convex hull, and convex cone hull) of is denoted by (resp., , , and ). Thus, if , then denotes the closure of . We shall adopt the convention that when is an empty set. Let be the dual cone of . The indicator function of is defined by The support function of is defined by
Let be an extended real valued function. The effective domain and the epigraph are defined by respectively. is said to be proper if and only if its effective domain is nonempty and . The conjugate function of is defined by Let . For any , the -subdifferential of at is the convex set defined by When , we define that . If , the set is the classical subdifferential of convex analysis. It is easy to prove that, for any and ,
Let be a convex set of . The -normal cone to at a point is defined by . If , is the normal cone of convex analysis. Moreover, it is easy to see that .
Let be a linear continuous mapping. The adjoint mapping of is defined by The infimal function of through is defined by
Let be an extended vector valued function. The domain and the -epigraph of are defined by respectively. is said to be proper if and only if . is said to be a -convex function if and only if, for any and , we have For any subset , we denote Moreover, let . The function is defined by We say that is star -lower semicontinuous if and only if is lower semicontinuous, for any .
Now, let us recall the following result which will be used in the following section.
Lemma 1 (see ). Let , be proper, convex, and lower semicontinuous functions. Then (i) is a global optimal solution of if and only if, for any , .(ii)If is a local optimal solution of , then .
In this section, we will employ the closedness qualification condition to derive necessary optimality conditions as well as necessary and sufficient optimality conditions for local and global minimizers in DC programs of type . Now, we first recall the closedness qualification condition .
Definition 2 (see ). The problem is said to satisfy the closedness qualification condition if the set is closed in the space .
The next lemma provides several characterizations of the closedness qualification condition . Moreover, the condition will be crucial in the sequel and it also deserves some attention for its independent interest.
Lemma 3 (see ). The closedness qualification condition holds if and only if, for any and any ,
Taking in Lemma 3, we can easily obtain the following subdifferential sum rule.
Proof. It is clear that can be rewritten as Then, by Lemma 1, is a global optimal solution of if and only if, for any , Moreover, by Lemma 3, this is further equivalent to This means that, for any , there exist and such that and . This completes the proof.
4. The Special Cases
In this section, we will give some special cases of our general results, which have been treated in the previous papers.
4.1. A Composed Convex Optimization Problem
4.2. A Constrained DC Optimization Problem
In this subsection, we consider the following DC optimization problem: Let . Obviously, is a proper, convex, lower semicontinuous, and -increasing function. Then can be seen as a particular case of the problem , since it can be rewritten as Since , we obtain that . Then, condition becomes Moreover, by (10), we obtain that, for any , if and only if and . Then, by Lemma 3, we get the following result.
Taking in Lemma 9, we can easily obtain the following subdifferential sum rule.
4.3. A Convex Optimization Problem with a Linear Operator
Let and , for any , where is a linear continuous mapping. Taking , one has that is a -convex function and . So, the problem becomes Since we get Then Thus, the condition becomes in this special case Moreover, for any , it is easy to see that . Then, by Lemma 3, we get the following result.
Taking in Lemma 13, we can easily obtain the following subdifferential sum rule.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
This research was partially supported by the National Natural Science Foundation of China (Grant no. 11301570), the Basic and Advanced Research Project of CQ CSTC (Grant no. cstc2013jcyjA00003), and the China Postdoctoral Science Foundation funded project (Grant no. 2013M540697).
- 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 -optimal solution in convex programming,” Optimization, vol. 57, no. 5, pp. 669–680, 2008.
- R. I. Boţ, I. B. Hodrea, and G. Wanka, “-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 -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.