{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:59:10Z","timestamp":1772297950825,"version":"3.50.1"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,11,20]],"date-time":"2015-11-20T00:00:00Z","timestamp":1447977600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Natural Science Foundation of China, Grant","award":["11171049"],"award-info":[{"award-number":["11171049"]}]},{"name":"Natural Science Foundation of China, Grant","award":["31271077"],"award-info":[{"award-number":["31271077"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s10589-015-9810-0","type":"journal-article","created":{"date-parts":[[2015,11,20]],"date-time":"2015-11-20T10:01:43Z","timestamp":1448013703000},"page":"433-465","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems"],"prefix":"10.1007","volume":"64","author":[{"given":"Li-Ping","family":"Pang","sequence":"first","affiliation":[]},{"given":"Jian","family":"Lv","sequence":"additional","affiliation":[]},{"given":"Jin-He","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,20]]},"reference":[{"key":"9810_CR1","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1137\/120903099","volume":"24","author":"WV Ackooij","year":"2014","unstructured":"Ackooij, W.V., Sagastizbal, C.: Constrained bundle methods for upper inexact oracles with application to joint chance constrained energy problems. SIAM J. Optim. 24, 733\u2013765 (2014)","journal-title":"SIAM J. Optim."},{"key":"9810_CR2","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s10107-005-0583-6","volume":"103","author":"B Bhattacharjee","year":"2005","unstructured":"Bhattacharjee, B., Lemonidis, P., Green Jr, W.H., Barton, P.I.: Global solution of semi-infinite programs. Math. Program. 103, 283\u2013307 (2005)","journal-title":"Math. Program."},{"key":"9810_CR3","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/s10957-008-9407-1","volume":"139","author":"MJ C\u00e1novas","year":"2008","unstructured":"C\u00e1novas, M.J., Hantoute, A., L\u00e1opez, M.A., Parra, J.: Stability of indices in the KKT conditions and metric regularity in convex semi-infinite optimization. J. Optim. Theory Appl. 139, 485\u2013500 (2008)","journal-title":"J. Optim. Theory Appl."},{"key":"9810_CR4","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1287\/opre.1090.0741","volume":"58","author":"E Delage","year":"2010","unstructured":"Delage, E., Ye, Y.: Distributionally robust optimization under moment uncertainty with application to data-driven problems. Oper. Res. 58, 595\u2013612 (2010)","journal-title":"Oper. Res."},{"key":"9810_CR5","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/s10589-009-9288-8","volume":"46","author":"G Emiel","year":"2010","unstructured":"Emiel, G., Sagastiz\u00e1bal, C.: Incremental-like bundle methods with application to energy planning. Comput. Optim. Appl. 46, 305\u2013332 (2010)","journal-title":"Comput. Optim. Appl."},{"key":"9810_CR6","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0377-0427(00)00544-6","volume":"129","author":"SC Fang","year":"2001","unstructured":"Fang, S.C., Lin, C.J., Wu, S.-Y.: Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme. J. Comput. Appl. Math. 129, 89\u2013104 (2001)","journal-title":"J. Comput. Appl. Math."},{"key":"9810_CR7","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1137\/S1052623402411459","volume":"14","author":"A Fuduli","year":"2005","unstructured":"Fuduli, A., Gaudioso, M., Giallombardo, G.: Minimizing nonconvex nonsmooth functions via cutting planes and proximity control. SIAM J. Optim. 14, 743\u2013756 (2005)","journal-title":"SIAM J. Optim."},{"key":"9810_CR8","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.cnsns.2014.07.033","volume":"21","author":"A Fuduli","year":"2014","unstructured":"Fuduli, A., Gaudioso, M., Giallombardo, G., Miglionico, G.: A partially inexact bundle method for convex semi-infinite minmax problems. Commun Nonlinear Sci Numer Simulat 21, 172\u2013180 (2014)","journal-title":"Commun Nonlinear Sci Numer Simulat"},{"key":"9810_CR9","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1287\/moor.1050.0175","volume":"31","author":"M Gaudioso","year":"2006","unstructured":"Gaudioso, M., Giallombardo, G., Miglionico, G.: An incremental method for solving convex finite Min-Max problems. Math. Oper. Res. 31, 173\u2013187 (2006)","journal-title":"Math. Oper. Res."},{"key":"9810_CR10","volume-title":"Linear Semi-infinite Optimization","author":"MA Goberna","year":"1998","unstructured":"Goberna, M.A., L\u00e1pez, M.A.: Linear Semi-infinite Optimization. Wiley, New York (1998)"},{"key":"9810_CR11","doi-asserted-by":"crossref","unstructured":"Hare, W., Sagastiz\u00e1bal, C., Solodov, M.: A proximal bundle method for nonsmooth nonconvex functions with inexact information. Comput. Optim. Appl. doi: 10.1007\/s10589-015-9762-4","DOI":"10.1007\/s10589-015-9762-4"},{"key":"9810_CR12","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/S1052623497328987","volume":"10","author":"C Helmberg","year":"2000","unstructured":"Helmberg, C., Rendl, F.: A spectral bundle method for semi-definite programming. SIAM J. Optim. 10, 673\u2013696 (2000)","journal-title":"SIAM J. Optim."},{"key":"9810_CR13","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF01582235","volume":"34","author":"R Hettich","year":"1986","unstructured":"Hettich, R.: An implementation of a discretization method for semi-infinite programming. Math. Program. 34, 354\u2013361 (1986)","journal-title":"Math. Program."},{"key":"9810_CR14","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1137\/1035089","volume":"35","author":"R Hettich","year":"1993","unstructured":"Hettich, R., Kortanek, K.O.: Semi-infinite programming: theory, methods and applications. SIAM Rev. 35, 380\u2013429 (1993)","journal-title":"SIAM Rev."},{"key":"9810_CR15","volume-title":"Convex analysis and minimization algorithms","author":"JB Hiriart-Urruty","year":"1991","unstructured":"Hiriart-Urruty, J.B., Lemarechal, C.: Convex analysis and minimization algorithms. Springer, Berlin, Heidelberg (1991)"},{"key":"9810_CR16","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BF01585730","volume":"46","author":"H Hu","year":"1990","unstructured":"Hu, H.: A one-phase algorithm for semi-infinite linear programming. Math. Program. 46, 85\u2013103 (1990)","journal-title":"Math. Program."},{"key":"9810_CR17","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1007\/s10589-014-9698-0","volume":"60","author":"P Jin","year":"2015","unstructured":"Jin, P., Ling, C., Shen, H.F.: A smoothing Levenberg-Marquardt algorithm for semi-infinite programming. Comput. Optim. Appl. 60, 675\u2013695 (2015)","journal-title":"Comput. Optim. Appl."},{"key":"9810_CR18","first-page":"145","volume":"83","author":"HTh Jongen","year":"1998","unstructured":"Jongen, HTh, R\u00fcckmann, J.-J., Stein, O.: Generalized semi-infinite optimization: a first order optimality condition and examples. Math. Program. 83, 145\u2013158 (1998)","journal-title":"Math. Program."},{"key":"9810_CR19","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1007\/s10898-010-9561-5","volume":"49","author":"N Kanzi","year":"2011","unstructured":"Kanzi, N.: Necessary optimality conditions for nonsmooth semi-infinite programming problems. J. Glob. Optim. 49, 713\u2013725 (2011)","journal-title":"J. Glob. Optim."},{"key":"9810_CR20","first-page":"717","volume":"53","author":"N Kanzi","year":"2008","unstructured":"Kanzi, N., Nobakhtian, S.: Optimality conditions for nonsmooth semi-infinite programming. Optimization 53, 717\u2013727 (2008)","journal-title":"Optimization"},{"key":"9810_CR21","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.jmaa.2008.10.009","volume":"351","author":"N Kanzi","year":"2008","unstructured":"Kanzi, N., Nobakhtian, S.: Nonsmooth semi-infinite programming problems with mixed constraints. J. Math. Anal. Appl. 351, 170\u2013181 (2008)","journal-title":"J. Math. Anal. Appl."},{"key":"9810_CR22","unstructured":"Kibardin, V.M.: Decomposition into functions in the minimization problem. Avtomat. i Telemekh., no. 9 (1979), 66\u201379 (in Russian). Automat. Remote Control 40, 1311\u20131323 (1980). (in English)"},{"key":"9810_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0074500","volume-title":"Methods of Descent for Nondifferentiable Optimization. Lecture Notes in Mathematics","author":"KC Kiwiel","year":"1985","unstructured":"Kiwiel, K.C.: Methods of Descent for Nondifferentiable Optimization. Lecture Notes in Mathematics. Springer, Berlin (1985)"},{"key":"9810_CR24","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1137\/S1052623400376366","volume":"14","author":"KC Kiwiel","year":"2003","unstructured":"Kiwiel, K.C.: Convergence of approximate and incremental subgradient methods for convex optimization. SIAM J. Optim. 14, 807\u2013840 (2003)","journal-title":"SIAM J. Optim."},{"key":"9810_CR25","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1137\/040603929","volume":"16","author":"KC Kiwiel","year":"2006","unstructured":"Kiwiel, K.C.: A proximal bundle method with approximate subgradient linearizations. SIAM J. Optim. 16, 1007\u20131023 (2006)","journal-title":"SIAM J. Optim."},{"key":"9810_CR26","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1137\/0803047","volume":"3","author":"KO Kortanek","year":"1993","unstructured":"Kortanek, K.O., No, H.: A central cutting plane algorithm for convex semi-infinite programming problems. SIAM J. Optim. 3, 901\u2013918 (1993)","journal-title":"SIAM J. Optim."},{"key":"9810_CR27","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s10898-004-8266-z","volume":"30","author":"DH Li","year":"2004","unstructured":"Li, D.H., Qi, L., Tam, J., Wu, S.-Y.: A smoothing Newton method for semi-infinite programming. J. Glob. Optim. 30, 169\u2013194 (2004)","journal-title":"J. Glob. Optim."},{"key":"9810_CR28","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1137\/060676982","volume":"19","author":"C Li","year":"2008","unstructured":"Li, C., Ng, K.F., Pong, T.K.: Constraint qualifications for convex inequality systems with applications in constrained optimization. SIAM J. Optim. 19, 163\u2013187 (2008)","journal-title":"SIAM J. Optim."},{"key":"9810_CR29","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/s10898-009-9462-7","volume":"47","author":"C Ling","year":"2010","unstructured":"Ling, C., Ni, Q., Qi, L.Q., Wu, S.-Y.: A new smoothing Newton-type algorithm for semi-infinite programming. J. Glob. Optim. 47, 133\u2013159 (2010)","journal-title":"J. Glob. Optim."},{"key":"9810_CR30","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/j.ejor.2006.08.045","volume":"180","author":"MA L\u00f3pez","year":"2007","unstructured":"L\u00f3pez, M.A., Still, G.: Semi-infinite programming. Eur. J. Oper. Res. 180, 491\u2013518 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9810_CR31","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1016\/j.amc.2015.05.119","volume":"265","author":"J Lv","year":"2015","unstructured":"Lv, J., Pang, L.P., Wang, J.H.: Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization. Appl. Math. Comput. 265, 635\u2013651 (2015)","journal-title":"Appl. Math. Comput."},{"key":"9810_CR32","doi-asserted-by":"crossref","first-page":"1670","DOI":"10.1137\/130925013","volume":"24","author":"S Mehrotra","year":"2014","unstructured":"Mehrotra, S., Papp, D.: A cutting surface algorithm for semi-infinite convex programming with an application to moment robust optimization. SIAM J. Optim. 24, 1670\u20131697 (2014)","journal-title":"SIAM J. Optim."},{"key":"9810_CR33","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1137\/110857738","volume":"23","author":"Boris S Mordukhovich","year":"2013","unstructured":"Mordukhovich, Boris S., Nghia, T.T.A.: Subdifferentials of nonconvex supremum functions and their applications to semi-infinite and infinite programs with Lipschitzian data. SIAM J. Optim. 23, 406\u2013431 (2013)","journal-title":"SIAM J. Optim."},{"key":"9810_CR34","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/S1052623499362111","volume":"12","author":"A Nedi\u0107","year":"2001","unstructured":"Nedi\u0107, A., Bertsekas, D.P.: Incremental subgradient methods for nondifferentiable optimization. SIAM J. Optim. 12, 109\u2013138 (2001)","journal-title":"SIAM J. Optim."},{"key":"9810_CR35","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/s10107-007-0112-x","volume":"116","author":"TTV Nguyen","year":"2009","unstructured":"Nguyen, T.T.V., Strodiot, J.J., Nguyen, V.H.: A bundle method for solving equilibrium problems. Math. Program. 116, 529\u2013552 (2009)","journal-title":"Math. Program."},{"key":"9810_CR36","doi-asserted-by":"crossref","first-page":"1137","DOI":"10.1137\/040619867","volume":"16","author":"Q Ni","year":"2006","unstructured":"Ni, Q., Ling, C., Qi, L., Teo, K.L.: A truncated projected Newton-type algorithm for large-scale semi-infinite programming. SIAM J. Optim. 16, 1137\u20131154 (2006)","journal-title":"SIAM J. Optim."},{"key":"9810_CR37","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1137\/100808289","volume":"21","author":"W Oliveira","year":"2011","unstructured":"Oliveira, W., Sagastiz\u00e1bal, C., Scheimberg, S.: Inexact bundle methods for two-stage stochastic programming. SIAM J. Optim. 21, 517\u2013544 (2011)","journal-title":"SIAM J. Optim."},{"key":"9810_CR38","doi-asserted-by":"crossref","unstructured":"Pang, L. P., Wang, M. Z., Xia, Z. Q.: First order necessary optimality conditions for a class of nonsmooth generalized semiinfinite optimization problems. Comput. Math. Appl. 56, 1457\u20131464 (2008)","DOI":"10.1016\/j.camwa.2008.02.037"},{"key":"9810_CR39","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF01585175","volume":"62","author":"E Polak","year":"1993","unstructured":"Polak, E.: On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems. Math. Program. 62, 385\u2013414 (1993)","journal-title":"Math. Program."},{"key":"9810_CR40","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/BF02564714","volume":"7","author":"R Puente","year":"1999","unstructured":"Puente, R., VeraDe Serio, V.N.: Locally farkas minkowski linear inequality systems. Top 7, 103\u2013121 (1999)","journal-title":"Top"},{"key":"9810_CR41","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1023\/A:1024814401713","volume":"27","author":"L Qi","year":"2003","unstructured":"Qi, L., Wu, S.Y., Zhou, G.: Semismooth Newton methods for solving semi-infinite programming problems. J. Global Optim. 27, 215\u2013232 (2003)","journal-title":"J. Global Optim."},{"key":"9810_CR42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10589-007-9117-x","volume":"42","author":"L Qi","year":"2009","unstructured":"Qi, L., Ling, C., Tong, X.J., Zhou, G.: A smoothing projected Newton-type algorithm for semi-infinite programming. Comput. Optim. Appl. 42, 1\u201330 (2009)","journal-title":"Comput. Optim. Appl."},{"key":"9810_CR43","doi-asserted-by":"crossref","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":"9810_CR44","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, J.J.-B.: Variational Analysis. Springer, Berlin (1998)"},{"key":"9810_CR45","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s10107-012-0570-7","volume":"134","author":"C Sagastiz\u00e1bal","year":"2012","unstructured":"Sagastiz\u00e1bal, C.: Divide to conquer: decomposition methods for energy optimization. Math. Program. 134, 187\u2013222 (2012)","journal-title":"Math. Program."},{"key":"9810_CR46","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/040603875","volume":"16","author":"C Sagastiz\u00e1bal","year":"2005","unstructured":"Sagastiz\u00e1bal, C., Solodov, M.V.: An infeasible bundle method for nonsmooth convex constrained optimization without a penalty function or a filter. SIAM J. Optim. 16, 146\u2013169 (2005)","journal-title":"SIAM J. Optim."},{"key":"9810_CR47","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1137\/S1052623401384096","volume":"14","author":"G Salmon","year":"2004","unstructured":"Salmon, G., Strodiot, J.-J., Nguyen, V.H.: A bundle method for solving variational inequalities. SIAM J. Optim. 14, 869\u2013893 (2004)","journal-title":"SIAM J. Optim."},{"key":"9810_CR48","doi-asserted-by":"crossref","unstructured":"Shen, J., Pang, L. P.: A proximal analytic center cutting plane algorithm for solving variational inequality problems. J. Appl. Math. (2012). doi: 10.1155\/2012\/503242","DOI":"10.1155\/2012\/503242"},{"key":"9810_CR49","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1137\/050647566","volume":"18","author":"MV Solodov","year":"2007","unstructured":"Solodov, M.V.: A bundle method for a class of bilevel nonsmooth convex minimization problems. SIAM J. Optim. 18, 242\u2013259 (2007)","journal-title":"SIAM J. Optim."},{"key":"9810_CR50","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1023\/B:JOTA.0000037607.48762.45","volume":"121","author":"O Stein","year":"2004","unstructured":"Stein, O.: On constraint qualifications in nonsmooth optimization. J. Optim. Theory. Appl. 121, 647\u2013671 (2004)","journal-title":"J. Optim. Theory. Appl."},{"key":"9810_CR51","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s101070100239","volume":"91","author":"G Still","year":"2001","unstructured":"Still, G.: Discretization in semi-infinite programming: the rate of convergence. Math. Program. 91, 53\u201369 (2001)","journal-title":"Math. Program."},{"key":"9810_CR52","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0377-0427(88)90276-2","volume":"23","author":"Y Tanaka","year":"1988","unstructured":"Tanaka, Y., Fukushima, M., Ibaraki, T.: A globally convergent SQP method for semi-infinite nonlinear optimization. J. Comput. Appl. Math. 23, 141\u2013153 (1988)","journal-title":"J. Comput. Appl. Math."},{"key":"9810_CR53","first-page":"215","volume":"28","author":"KL Teo","year":"2000","unstructured":"Teo, K.L., Yang, X.Q., Jennings, L.S.: Computational discretization algorithms for functional inequality constrained optimization. Ann. Oper. Res. 28, 215\u2013234 (2000)","journal-title":"Ann. Oper. Res."},{"key":"9810_CR54","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1080\/02331938808843393","volume":"19","author":"R Tichatschke","year":"1988","unstructured":"Tichatschke, R., Nebeling, V.: A cutting plane method for quadratic semi-infinite programming Problems. Optimization 19, 803\u2013817 (1988)","journal-title":"Optimization"},{"key":"9810_CR55","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1023\/A:1021763419562","volume":"99","author":"S-Y Wu","year":"1998","unstructured":"Wu, S.-Y., Fang, S.C., Lin, C.J.: Relaxed cutting plane method for solving linear semi-infinite programming problems. J. Optim. Theory Appl. 99, 759\u2013779 (1998)","journal-title":"J. Optim. Theory Appl."},{"key":"9810_CR56","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1080\/10556780500094739","volume":"20","author":"S-Y Wu","year":"2005","unstructured":"Wu, S.-Y., Li, D.H., Qi, L., Zhou, G.: An iterative method for solving KKT system of the semi-infinite programming. Optim. Methods Softw. 20, 629\u2013643 (2005)","journal-title":"Optim. Methods Softw."},{"key":"9810_CR57","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0898-1221(99)00203-5","volume":"38","author":"S-Y Wu","year":"1999","unstructured":"Wu, S.-Y., Fang, S.C.: Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method. Comput. Math. Appl. 38, 23\u201333 (1999)","journal-title":"Comput. Math. Appl."},{"key":"9810_CR58","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1007\/s10589-014-9654-z","volume":"59","author":"MW Xu","year":"2014","unstructured":"Xu, M.W., Wu, S.-Y., Ye, J.J.: Solving semi-infinite programs by smoothing projected gradient method. Comput. Optim. Appl. 59, 591\u2013616 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"9810_CR59","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s11071-013-0768-0","volume":"73","author":"QJ Xu","year":"2013","unstructured":"Xu, Q.J., Jian, J.B.: A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems. Nonlinear Dyn. 73, 85\u201392 (2013)","journal-title":"Nonlinear Dyn."},{"key":"9810_CR60","doi-asserted-by":"crossref","first-page":"2959","DOI":"10.1137\/090767133","volume":"20","author":"LP Zhang","year":"2010","unstructured":"Zhang, L.P., Wu, S.-Y., L\u00f3pez, M.A.: A new exchange method for convex semi-infinite programming. SIAM J. Optim. 20, 2959\u20132977 (2010)","journal-title":"SIAM J. Optim."},{"key":"9810_CR61","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1287\/moor.1060.0234","volume":"32","author":"XY Zheng","year":"2007","unstructured":"Zheng, X.Y., Yang, X.Q.: Lagrange multipliers in nonsmooth semi-infinite optimization problems. Math. Oper. Res. 32, 168\u2013181 (2007)","journal-title":"Math. Oper. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9810-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-015-9810-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9810-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:37:41Z","timestamp":1559241461000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-015-9810-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,20]]},"references-count":61,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["9810"],"URL":"https:\/\/doi.org\/10.1007\/s10589-015-9810-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,20]]}}}