{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:12:43Z","timestamp":1767237163073,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2019,8,16]],"date-time":"2019-08-16T00:00:00Z","timestamp":1565913600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,16]],"date-time":"2019-08-16T00:00:00Z","timestamp":1565913600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11471059"],"award-info":[{"award-number":["11471059"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s11590-019-01464-3","type":"journal-article","created":{"date-parts":[[2019,8,16]],"date-time":"2019-08-16T11:02:36Z","timestamp":1565953356000},"page":"1711-1730","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["On approximate solutions and saddle point theorems for robust convex optimization"],"prefix":"10.1007","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4329-9845","authenticated-orcid":false,"given":"Xiang-Kai","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kok Lay","family":"Teo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao-Le","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,16]]},"reference":[{"key":"1464_CR1","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"1464_CR2","doi-asserted-by":"publisher","DOI":"10.1142\/5021","volume-title":"Convex Analysis in General Vector Spaces","author":"C Zalinescu","year":"2002","unstructured":"Zalinescu, C.: Convex Analysis in General Vector Spaces. World Scientific, Singapore (2002)"},{"key":"1464_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"1464_CR4","doi-asserted-by":"publisher","first-page":"1088","DOI":"10.1002\/mana.200510662","volume":"281","author":"RI Bo\u0163","year":"2008","unstructured":"Bo\u0163, R.I., Grad, S.M., Wanka, G.: A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces. Math. Nachr. 281, 1088\u20131107 (2008)","journal-title":"Math. Nachr."},{"key":"1464_CR5","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10107-008-0207-z","volume":"119","author":"L Ban","year":"2009","unstructured":"Ban, L., Song, W.: Duality gap of the conic convex constrained optimization problems in normed spaces. Math. Program. 119, 195\u2013214 (2009)","journal-title":"Math. Program."},{"key":"1464_CR6","doi-asserted-by":"publisher","first-page":"1311","DOI":"10.1137\/080739124","volume":"20","author":"DH Fang","year":"2009","unstructured":"Fang, D.H., Li, C., Ng, K.F.: Constraint qualifications for extended Farkas\u2019s lemmas and Lagrangian dualities in convex infinite programming. SIAM J. Optim. 20, 1311\u20131332 (2009)","journal-title":"SIAM J. Optim."},{"key":"1464_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04900-2","volume-title":"Conjugate Duality in Convex Optimization","author":"RI Bo\u0163","year":"2010","unstructured":"Bo\u0163, R.I.: Conjugate Duality in Convex Optimization. Springer, Berlin (2010)"},{"key":"1464_CR8","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1287\/moor.23.4.769","volume":"23","author":"A Ben-Tal","year":"1998","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust convex optimization. Math. Oper. Res. 23, 769\u2013805 (1998)","journal-title":"Math. Oper. Res."},{"key":"1464_CR9","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s101070100286","volume":"92","author":"A Ben-Tal","year":"2002","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust optimization-methodology and applications. Math. Program. Ser. B 92, 453\u2013480 (2002)","journal-title":"Math. Program. Ser. B"},{"key":"1464_CR10","doi-asserted-by":"publisher","first-page":"2327","DOI":"10.1016\/j.na.2010.11.036","volume":"74","author":"GY Li","year":"2011","unstructured":"Li, G.Y., Jeyakumar, V., Lee, G.M.: Robust conjugate duality for convex optimization under uncertainty with application to data classification. Nonlinear Anal. 74, 2327\u20132341 (2011)","journal-title":"Nonlinear Anal."},{"key":"1464_CR11","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/j.ejor.2013.10.028","volume":"234","author":"J Fliege","year":"2013","unstructured":"Fliege, J., Werner, R.: Robust multiobjective optimization and applications in portfolio optimization. Eur. J. Oper. Res. 234, 422\u2013433 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"1464_CR12","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.ejor.2017.03.041","volume":"262","author":"P Xidonas","year":"2017","unstructured":"Xidonas, P., Mavrotas, G., Hassapis, C., Zopounidis, C.: Robust multiobjective portfolio optimization: a minimax regret approach. Eur. J. Oper. Res. 262, 299\u2013305 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"1464_CR13","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10589-013-9634-8","volume":"58","author":"G Li","year":"2014","unstructured":"Li, G., Ma, A.K.C., Pong, T.K.: Robust least square semidefinite programming with applications. Comput. Optim. Appl. 58, 347\u2013379 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"1464_CR14","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/s10957-012-0234-z","volume":"159","author":"H Yu","year":"2013","unstructured":"Yu, H., Liu, H.M.: Robust multiple objective game theory. J. Optim. Theory Appl. 159, 272\u2013280 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"1464_CR15","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10479-017-2751-5","volume":"271","author":"EK Doolittle","year":"2018","unstructured":"Doolittle, E.K., Kerivin, H.L.M., Wiecek, M.M.: Robust multiobjective optimization with application to internet routing. Ann. Oper. Res. 271, 487\u2013525 (2018)","journal-title":"Ann. Oper. Res."},{"key":"1464_CR16","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1007\/s10957-018-1256-y","volume":"177","author":"HZ Wei","year":"2018","unstructured":"Wei, H.Z., Chen, C.R., Li, S.J.: Characterizations for optimality conditions of general robust optimization problems. J. Optim. Theory Appl. 177, 835\u2013856 (2018)","journal-title":"J. Optim. Theory Appl."},{"key":"1464_CR17","doi-asserted-by":"publisher","first-page":"3384","DOI":"10.1137\/100791841","volume":"20","author":"V Jeyakumar","year":"2010","unstructured":"Jeyakumar, V., Li, G.: Strong duality in robust convex programming: complete characterizations. SIAM J. Optim. 20, 3384\u20133407 (2010)","journal-title":"SIAM J. Optim."},{"key":"1464_CR18","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s11228-012-0219-y","volume":"21","author":"RI Bo\u0163","year":"2013","unstructured":"Bo\u0163, R.I., Jeyakumar, V., Li, G.Y.: Robust duality in parametric convex optimization. Set Valued Var. Anal. 21, 177\u2013189 (2013)","journal-title":"Set Valued Var. Anal."},{"key":"1464_CR19","first-page":"1125","volume":"15","author":"D Kuroiwa","year":"2014","unstructured":"Kuroiwa, D., Lee, G.M.: On robust convex multiobjective optimization. J. Nonlinear Convex Anal. 15, 1125\u20131136 (2014)","journal-title":"J. Nonlinear Convex Anal."},{"key":"1464_CR20","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10957-014-0564-0","volume":"64","author":"V Jeyakumar","year":"2015","unstructured":"Jeyakumar, V., Lee, G.M., Li, G.: Characterizing robust solutions sets convex programs under data uncertainty. J. Optim. Theory Appl. 64, 407\u2013435 (2015)","journal-title":"J. Optim. Theory Appl."},{"key":"1464_CR21","doi-asserted-by":"publisher","first-page":"1463","DOI":"10.1007\/s11590-015-0946-8","volume":"10","author":"XK Sun","year":"2016","unstructured":"Sun, X.K., Peng, Z.Y., Guo, X.L.: Some characterizations of robust optimal solutions for uncertain convex optimization problems. Optim. Lett. 10, 1463\u20131478 (2016)","journal-title":"Optim. Lett."},{"key":"1464_CR22","doi-asserted-by":"publisher","first-page":"984","DOI":"10.1007\/s10957-019-01496-w","volume":"182","author":"XK Sun","year":"2019","unstructured":"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, 984\u20131000 (2019)","journal-title":"J. Optim. Theory Appl."},{"key":"1464_CR23","first-page":"29","volume":"13","author":"M Barro","year":"2017","unstructured":"Barro, M., Ou\u00e9draogo, A., Traor\u00e9, S.: On uncertain conical convex optimization problems. Pac. J. Optim. 13, 29\u201342 (2017)","journal-title":"Pac. J. Optim."},{"key":"1464_CR24","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1007\/s10957-017-1136-x","volume":"174","author":"N Dinh","year":"2017","unstructured":"Dinh, N., Goberna, M.A., Lopez, M.A., Volle, M.: A unifying approach to robust convex infinite optimization duality. J. Optim. Theory Appl. 174, 650\u2013685 (2017)","journal-title":"J. Optim. Theory Appl."},{"key":"1464_CR25","doi-asserted-by":"publisher","first-page":"1387","DOI":"10.1007\/s11590-017-1187-9","volume":"12","author":"XB Li","year":"2018","unstructured":"Li, X.B., Wang, S.: Characterizations of robust solution set of convex programs with uncertain data. Optim. Lett. 12, 1387\u20131402 (2018)","journal-title":"Optim. Lett."},{"key":"1464_CR26","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10013-018-0283-1","volume":"46","author":"N Dinh","year":"2018","unstructured":"Dinh, N., Long, D.H.: Complete characterizations of robust strong duality for robust vector optimization problems. Vietnam J. Math. 46, 293\u2013328 (2018)","journal-title":"Vietnam J. Math."},{"key":"1464_CR27","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s11117-012-0186-4","volume":"16","author":"JH Lee","year":"2012","unstructured":"Lee, J.H., Lee, G.M.: On $$\\varepsilon $$-solutions for convex optimization problems with uncertainty data. Positivity 16, 509\u2013526 (2012)","journal-title":"Positivity"},{"key":"1464_CR28","doi-asserted-by":"publisher","first-page":"1609","DOI":"10.1007\/s11590-016-1067-8","volume":"11","author":"JH Lee","year":"2017","unstructured":"Lee, J.H., Jiao, L.: On quasi $$\\varepsilon $$-solution for robust convex optimization problems. Optim. Lett. 11, 1609\u20131622 (2017)","journal-title":"Optim. Lett."},{"key":"1464_CR29","first-page":"621","volume":"13","author":"XK Sun","year":"2017","unstructured":"Sun, X.K., Li, X.B., Long, X.J., Peng, Z.Y.: On robust approximate optimal solutions for uncertain convex optimization and applications to multi-objective optimization. Pac. J. Optim. 13, 621\u2013643 (2017)","journal-title":"Pac. J. Optim."},{"key":"1464_CR30","doi-asserted-by":"publisher","first-page":"12","DOI":"10.3390\/math7010012","volume":"7","author":"XK Sun","year":"2019","unstructured":"Sun, X.K., Fu, H.Y., Zeng, J.: Robust approximate optimality conditions for uncertain nonsmooth optimization with infinite number of constraints. Mathematics 7, 12 (2019)","journal-title":"Mathematics"},{"key":"1464_CR31","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/BFb0120986","volume":"19","author":"P Loridan","year":"1982","unstructured":"Loridan, P.: Necessary conditions for $$\\varepsilon $$-optimality. Math. Program. Stud. 19, 140\u2013152 (1982)","journal-title":"Math. Program. Stud."},{"key":"1464_CR32","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF00940466","volume":"69","author":"JC Liu","year":"1991","unstructured":"Liu, J.C.: $$\\varepsilon $$-Duality theorem of nondifferentiable nonconvex multiobjective programming. J. Optim. Theory Appl. 69, 153\u2013167 (1991)","journal-title":"J. Optim. Theory Appl."},{"key":"1464_CR33","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10898-012-9994-0","volume":"57","author":"TQ Son","year":"2013","unstructured":"Son, T.Q., Kim, D.S.: $$\\varepsilon $$-Mixed type duality for nonconvex multiobjective programs with an infinite number of constraints. J. Glob. Optim. 57, 447\u2013465 (2013)","journal-title":"J. Glob. Optim."},{"key":"1464_CR34","doi-asserted-by":"publisher","first-page":"597","DOI":"10.4134\/CKMS.2013.28.3.597","volume":"28","author":"MH Kim","year":"2013","unstructured":"Kim, M.H.: Duality theorem and vector saddle point theorem for robust multiobjective optimization problems. Commun. Korean Math. Soc. 28, 597\u2013602 (2013)","journal-title":"Commun. Korean Math. Soc."},{"key":"1464_CR35","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ejor.2017.08.003","volume":"265","author":"M Fakhar","year":"2018","unstructured":"Fakhar, M., Mahyarinia, M.R., Zafarani, J.: On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization. Eur. J. Oper. Res. 265, 39\u201348 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"1464_CR36","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1023\/A:1022606002804","volume":"93","author":"V Jeyakumar","year":"1997","unstructured":"Jeyakumar, V.: Asymptotic dual conditions characterizing optimality for convex programs. J. Optim. Theory Appl. 93, 153\u2013165 (1997)","journal-title":"J. Optim. Theory Appl."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-019-01464-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-019-01464-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-019-01464-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,14]],"date-time":"2020-09-14T13:06:38Z","timestamp":1600088798000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-019-01464-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,16]]},"references-count":36,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["1464"],"URL":"https:\/\/doi.org\/10.1007\/s11590-019-01464-3","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2019,8,16]]},"assertion":[{"value":"10 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 August 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}