×

Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials. (English) Zbl 1470.90095

Necessary optimality conditions involving elements of solution sets to nonconvex semi-infinite programming problems related to tangential subdifferentials are provided and it is also shown that the Lagrangian function associated to a fixed Lagrange multiplier is constant on such solution sets. Two new characterizations of such solution sets are then derived by means of Dini pseudoconvexity, while some examples illustrate the theoretical achievements.

MSC:

90C26 Nonconvex programming, global optimization
90C34 Semi-infinite programming
90C46 Optimality conditions and duality in mathematical programming
Full Text: DOI

References:

[1] Mangasarian, O. L., A simple characterization of solution sets of convex programs, Oper. Res. Lett, 7, 1, 21-26 (1988) · Zbl 0653.90055 · doi:10.1016/0167-6377(88)90047-8
[2] Burke, J. V.; Ferris, M. C., Characterization of solution sets of convex programs, Oper. Res. Lett, 10, 1, 57-60 (1991) · Zbl 0719.90055 · doi:10.1016/0167-6377(91)90087-6
[3] Jeyakumar, V.; Lee, G. M.; Dinh, N., Lagrange multiplier conditions characterizing optimal solution sets of cone-constrained convex programs, J. Optim. Theory Appl, 123, 1, 83-103 (2004) · Zbl 1114.90091 · doi:10.1023/B:JOTA.0000043992.38554.c8
[4] Jeyakumar, V.; Yang, X. Q., On characterizing the solution sets of pseudolinear programs, J. Optim. Theory Appl, 87, 3, 747-755 (1995) · Zbl 0840.90118 · doi:10.1007/BF02192142
[5] Ivanov, V. I., Characterizations of solution sets of differentiable quasiconvex programming problems, J. Optim. Theory Appl., 181, 1, 144-162 (2019) · Zbl 1414.90286 · doi:10.1007/s10957-018-1379-1
[6] Penot, J. P., Characterization of solution sets of quasiconvex programs, J. Optim. Theory Appl, 117, 3, 627-636 (2003) · Zbl 1043.90071 · doi:10.1023/A:1023905907248
[7] Zhao, K. Q.; Yang, X. M., Characterizations of the solution set for a class of nonsmooth optimization problems, Optim. Lett, 7, 4, 685-694 (2013) · Zbl 1269.90112 · doi:10.1007/s11590-012-0471-y
[8] Yang, X. M., On characterizing the solution sets of pseudoinvex extremum problems, J. Optim. Theory Appl, 140, 3, 537-542 (2009) · Zbl 1189.90163 · doi:10.1007/s10957-008-9470-7
[9] Sun, X. K.; Teo, K. L.; Tang, L. P., Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems, J. Optim. Theory Appl, 182, 3, 984-1000 (2019) · Zbl 1422.49028 · doi:10.1007/s10957-019-01496-w
[10] Sun, X. K.; Long, X. J.; Fu, H. Y.; Li, X. B., Some characterizations of robust optimal solutions for uncertain fractional optimization and applications, J. Ind. Manag. Optim, 13, 2, 803-824 (2017) · Zbl 1364.90308 · doi:10.3934/jimo.2016047
[11] Dinh, N.; Mordukhovich, B. S.; Nghia, T. T. A., Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs, Math. Program, 123, 1, 101-138 (2010) · Zbl 1226.90102 · doi:10.1007/s10107-009-0323-4
[12] Goberna, M. A.; López, M. A., Linear Semi-Infinite Optimization (1998), Chichester: J. Wiley Sons, Chichester · Zbl 0909.90257
[13] Huy, N. Q.; Yao, J. C., Semi-infinite optimization under convex function perturbations: Lipschitz stability, J. Optim. Theory Appl, 148, 2, 237-256 (2011) · Zbl 1229.90245 · doi:10.1007/s10957-010-9753-7
[14] Kanzi, N., Constraint qualifications in semi-infinite systems and their applications in nonsmooth semi-infinite programs with mixed constraints, SIAM J. Optim, 24, 2, 559-572 (2014) · Zbl 1297.90164 · doi:10.1137/130910002
[15] Kanzi, N.; Caristi, G.; Sadeghieh, A., Optimality conditions for semi-infinite programming problems involving generalized convexity, Optim. Lett, 13, 1, 113-126 (2019) · Zbl 1462.90145 · doi:10.1007/s11590-018-1256-8
[16] Long, X. J.; Peng, Z. Y.; Wang, X. F., Stable Farkas lemmas and duality for nonconvex composite semi-infinite programming problems, Pacific J. Optim, 295-315 (2019) · Zbl 1503.90146
[17] Long, X. J.; Tang, L. P.; Peng, J. W., Optimality conditions for semi-infinite programming problems under relaxed quasiconvexity assumptions, Pacific J. Optim, 519-528 (2019) · Zbl 1454.90101
[18] Long, X. J.; Xiao, Y. B.; Huang, N. J., Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems, J. Oper. Res. Soc. China, 6, 2, 289-299 (2018) · Zbl 1413.90298 · doi:10.1007/s40305-017-0167-1
[19] Mordukhovich, B. S.; Nghia, T. T. A., Subdifferentials of nonconvex supremum functions and their applications to semi-infinite and infinite programs with Lipschitzian date, SIAM J. Optim, 23, 1, 406-431 (2013) · Zbl 1266.49027 · doi:10.1137/110857738
[20] Peng, Z. Y.; Wang, X. F.; Yang, X. M., Connectedness of approximate efficient solutions for generalized semi-infinite vector optimization problems, Set-Valued Var. Anal, 27, 1, 103-118 (2019) · Zbl 1430.90514 · doi:10.1007/s11228-017-0423-x
[21] Peng, Z. Y.; Peng, J. W.; Long, X. J.; Yao, J. C., On the stability of solutions for semi-infinite vector optimization problems, J. Glob. Optim, 70, 1, 55-69 (2018) · Zbl 1387.49041 · doi:10.1007/s10898-017-0553-6
[22] Peng, Z. Y.; Li, X. B.; Long, X. J.; Fan, X. D., Painleve-Kuratowski stability of approximate efficient solutions for perturbed semi-infinite vector optimization problems, Optim. Lett, 12, 6, 1339-1356 (2018) · Zbl 1396.90079 · doi:10.1007/s11590-017-1175-0
[23] Sun, X. K.; Teo, K. L.; Zeng, J.; Liu, L. Y., Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty, Optimization, 69, 9, 2109-2129 (2020) · Zbl 1451.90164 · doi:10.1080/02331934.2020.1763990
[24] Son, T. Q.; Dinh, N., Characterizations of optimal solution sets of convex infinite programs, Top, 16, 1, 147-163 (2008) · Zbl 1201.90158 · doi:10.1007/s11750-008-0039-2
[25] Kim, D. S.; Son, T. Q., Characterizations of solutions sets of a class of nonconvex semi-infinite programming problems, J. Nonl. Convex Anal, 429-440 (2011) · Zbl 1237.90185
[26] Son, T. Q.; Kim, D. S., A new approach to characterize the solution set of a pseudoconvex programming problem, J. Comput. Appl. Math, 261, 333-340 (2014) · Zbl 1278.90435 · doi:10.1016/j.cam.2013.11.004
[27] Martinez-Legaz, J. E., Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints, Optim. Lett (2015) · Zbl 1356.90108 · doi:10.1007/s11590-014-0822-y
[28] Tung, L. T., Strong Karush-Kuhn-Tucker optimality conditions for multiobjective semi-infinite programming via tangential subdifferential, RAIRO-Oper. Res, 52, 4-5, 1019-1041 (2018) · Zbl 1411.90334 · doi:10.1051/ro/2018020
[29] Sisarat, N.; Wangkeeree, R., Characterizing the solution set of convex optimization problems without convexity of constraints, Optim. Lett, 14, 5, 1127-1144 (2020) · Zbl 1491.90124 · doi:10.1007/s11590-019-01397-x
[30] Giorgi, G.; Jiménez, B.; Novo, V.; Konnov, I. V.; Luc, D. T., Generalized Convexity and Related Topics, 583, Sufficient optimality conditions and duality in nonsmooth multiobjective optimization problems under generalized convexity, 265-278 (2007), Springer · Zbl 1132.49019
[31] Giorgi, G.; Komlósi, S., Dini derivatives in optimization-Part I, Riv. Mat. Sci. Econ. Soc, 3-30 (1992) · Zbl 0871.49019
[32] Giorgi, G.; Jiménez, B.; Novo, V., On constraint qualification in directionally differentiable multiobjective optimization problems, RAIRO-Oper. Res, 38, 3, 255-274 (2004) · Zbl 1158.90421 · doi:10.1051/ro:2004023
[33] Dinh, N.; Goberna, M. A.; López, M. A.; Son, T. Q., New Farkas-type constraint qualifications in convex infinite programming, ESAIM: COCV, 13, 3, 580-597 (2007) · Zbl 1126.90059 · doi:10.1051/cocv:2007027
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.