Necessary optimality conditions for DC infinite programs with inequality constraints

Volume 9, Issue 2, pp 617--626 http://dx.doi.org/10.22436/jnsa.009.02.25

Download PDF

Download XML

• Export citations
  • CITATIONS & REFERENCES
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)
  • ARTICLE CITATION
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)
  • REFERENCES
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)

• 1370 Downloads
• 2192 Views

Authors

Xiang-Kai Sun - College of Mathematics and Statistics, Chongqing Technology and Business University, Chongqing 400067, China. - College of Automation, Chongqing University, Chongqing 400044, China. Xiao-Le Guo - School of Economics, Southwest University of Political Science and Law, Chongqing 401120, China. Jing Zeng - College of Mathematics and Statistics, Chongqing Technology and Business University, Chongqing 400067, China.

Abstract

In this paper, we first recall the regularity conditions introduced by Sun in [X. K. Sun, J. Math. Anal. Appl., 414 (2014), 590-611]. Then, by using these regularity conditions, we obtain some necessary optimality conditions for \(\varepsilon\)-optimal solution and exact optimal solution of a DC infinite programming problem with inequality constraints. Moreover, we also apply the obtained results to conic programming problems.

Share and Cite

Keywords

• DC infinite programming
• regularity conditions
• optimality
• conic programming.

MSC

•  49K27
•  90C26
•  90C46

References

• [1] F. Bai, Z. Wu, D. Zhu , Sequential Lagrange multiplier condition for \(\varepsilon\)-optimal solution in convex programming, Optimization, 57 (2008), 669-680.


• [2] R. I. Boţ, Conjugate duality in convex optimization, Springer-Verlag, Berlin (2010)


• [3] R. S. Burachik, V. Jeyakumar, A new geometric condition for Fenchel's duality in infinite dimensional spaces, Math. Program., 104 (2005), 229-233.


• [4] N. Dinh, B. S. Mordukhovich, T. T. A. Nghia, Qualification and optimality conditions for DC programs with infinite constraints, Acta Math. Vietnam., 34 (2009), 125-155.


• [5] N. Dinh, B. Mordukhovich, T. T. A. Nghia, Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs, Math. Program, 123 (2010), 101-138.


• [6] N. Dinh, T. T. A. Nghia, G. Vallet, A closedness condition and its applications to DC programs with convex constraints, Optimization, 59 (2010), 541-560.


• [7] D. H. Fang, G. M. Lee, C. Li, J. C. Yao, Extended Farkas's lemmas and strong Lagrange dualities for DC infinite programming, J. Nonlinear Convex Anal., 14 (2013), 747-767.


• [8] D. H. Fang, C. Li, K. F. Ng, Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming, SIAM J. Optim., 20 (2009), 1311-1332.


• [9] D. H. Fang, C. Li, K. F. Ng, Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming, Nonlinear Anal., 73 (2010), 1143-1159.


• [10] D. H. Fang, M. D. Wang, X. P. Zhao, The strong duality for DC optimization problems with composite convex functions, J. Nonlinear Convex Anal., 16 (2015), 1337-1352.


• [11] D. H. Fang, X. P. Zhao, Local and global optimality conditions for DC infinite optimization problems, Taiwanese J. Math., 18 (2014), 817-834.


• [12] X. L. Guo, S. J. Li, Optimality conditions for vector optimization problems with difference of convex maps, J. Optim. Theory Appl., 162 (2014), 821-844.


• [13] V. Jeyakumar, Asymptotic dual conditions characterizing of optimality for convex programs, J. Optim. Theory Appl., 93 (1997), 153-165.


• [14] G. Li, X. Q. Yang, Y. Y. Zhou, Stable strong and total parametrized dualities for DC optimization problems in locally convex spaces, J. Ind. Manag. Optim., 9 (2013), 671-687.


• [15] J. E. Martinez-Legaz, M. Volle, Duality in D.C. programming: the case of several D.C. constraints, J. Math. Anal. Appl., 237 (1999), 657-671.


• [16] X. K. Sun, Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming, J. Math. Anal. Appl., 414 (2014), 590-611.


• [17] X. K. Sun, Y. Chai, J. Zeng, Farkas-type results for constrained fractional programming with DC functions, Optim. Lett., 8 (2014), 2299-2313.


• [18] X. K. Sun, X. L. Guo, Y. Zhang, Fenchel-Lagrange duality for DC programs with composite functions, J. Nonlinear Convex Anal., 16 (2015), 1607-1618.


• [19] X. K. Sun, S. J. Li, Duality and Farkas-type results for extended Ky Fan inequalities with DC functions, Optim. Lett., 7 (2013), 499-510.


• [20] X. K. Sun, S. J. Li, D. Zhao, Duality and Farkas-type results for DC infinite programming with inequality constraints, Taiwanese J. Math., 17 (2013), 1227-1244.


• [21] X. K. Sun, X. J. Long, Y. Chai, Sequential optimality conditions for fractional optimization with applications to vector optimization, J. Optim. Theory Appl., 164 (2015), 479-499.


• [22] M. Volle, Duality principles for optimization problems dealing with the difference of vector-valued convex mappings, J. Optim. Theory Appl., 114 (2002), 223-241.


• [23] Y. Y. Zhou, G. Li, The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions, Numer. Algebra Control Optim., 4 (2014), 9-23.