{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T10:59:57Z","timestamp":1780657197923,"version":"3.54.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,9,22]],"date-time":"2021-09-22T00:00:00Z","timestamp":1632268800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,22]],"date-time":"2021-09-22T00:00:00Z","timestamp":1632268800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100014103","name":"Key Technology Research and Development Program of Shandong","doi-asserted-by":"publisher","award":["2019GGX104089"],"award-info":[{"award-number":["2019GGX104089"]}],"id":[{"id":"10.13039\/100014103","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2019BA014"],"award-info":[{"award-number":["ZR2019BA014"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s11075-021-01192-9","type":"journal-article","created":{"date-parts":[[2021,9,22]],"date-time":"2021-09-22T18:31:17Z","timestamp":1632335477000},"page":"387-422","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming"],"prefix":"10.1007","volume":"90","author":[{"given":"Li-Ping","family":"Pang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qi","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,9,22]]},"reference":[{"key":"1192_CR1","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1016\/S0098-1354(98)00027-1","volume":"22","author":"CS Adjiman","year":"1998","unstructured":"Adjiman, C.S., Androulakis, I.P., Floudas, C.A.: A global optimization method, \u03b1 BB, for general twice-differentiable constrained NLPs-I: theoretical advances. Comput. Chem. Eng. 22, 1137\u20131158 (1998)","journal-title":"Comput. Chem. Eng."},{"key":"1192_CR2","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1016\/S0098-1354(98)00218-X","volume":"22","author":"CS Adjiman","year":"1998","unstructured":"Adjiman, C.S., Androulakis, I.P., Floudas, C.A.: A global optimization method, \u03b1 BB, for general twice-differentiable constrained NLPs-II: implementation and computational results. Comput. Chem. Eng. 22, 1159\u20131179 (1998)","journal-title":"Comput. Chem. Eng."},{"key":"1192_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08114-4","volume-title":"Introduction to Nonsmooth Optimization: Theory, Practice and Software","author":"A Bagirov","year":"2014","unstructured":"Bagirov, A., Karmitsa, N., M\u00e4kel\u00e4, M. M.: Introduction to Nonsmooth Optimization: Theory, Practice and Software. Springer, Cham (2014)"},{"key":"1192_CR4","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10589-005-4556-8","volume":"30","author":"B Bhattacharjee","year":"2005","unstructured":"Bhattacharjee, B., Green, Jr.W. H., Barton, P.I.: Interval methods for semi-infinite programs. Comput. Optim. Appl. 30, 63\u201393 (2005)","journal-title":"Comput. Optim. Appl."},{"key":"1192_CR5","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10107-005-0583-6","volume":"103","author":"B Bhattacharjee","year":"2005","unstructured":"Bhattacharjee, B., Lemonidis, P., Green, W.H. Jr., Barton, P.I.: Global solution of semi-infinite programs. Math. Program. 103, 283\u2013307 (2005)","journal-title":"Math. Program."},{"key":"1192_CR6","volume-title":"Nonsmooth Analysis and Control Theory","author":"FH Clarke","year":"1998","unstructured":"Clarke, F.H., Ledyaev, Y.S., Stern, R.J., Wolenski, P.R.: Nonsmooth Analysis and Control Theory. Springer, New York (1998)"},{"issue":"1","key":"1192_CR7","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/j.jmaa.2003.11.004","volume":"291","author":"A Daniilidis","year":"2004","unstructured":"Daniilidis, A., Georgiev, P.: Approximate convexity and submonotonicity. J. Math. Anal. Appl. 291 (1), 292\u2013301 (2004)","journal-title":"J. Math. Anal. Appl."},{"key":"1192_CR8","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s10898-016-0476-7","volume":"68","author":"H Djelassi","year":"2017","unstructured":"Djelassi, H., Mitsos, A.: A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs. J Glob Optim. 68, 227\u2013253 (2017)","journal-title":"J Glob Optim."},{"key":"1192_CR9","doi-asserted-by":"publisher","first-page":"1187","DOI":"10.1137\/060657741","volume":"18","author":"CA Floudas","year":"2007","unstructured":"Floudas, C.A., Stein, O.: The adaptive convexification algorithm: a feasible point method for semi-infinite programming. SIAM J. Optim. 18, 1187\u20131208 (2007)","journal-title":"SIAM J. Optim."},{"key":"1192_CR10","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.cnsns.2014.07.033","volume":"21","author":"A Fuduli","year":"2015","unstructured":"Fuduli, A., Gaudioso, M., Giallombardo, G., Miglionico, G.: A partially inexact bundle method for convex semi-infinite minmax problems. Commun. Nonlinear Sci. Numer. Simul. 21, 172\u2013180 (2015)","journal-title":"Commun. Nonlinear Sci. Numer. Simul."},{"key":"1192_CR11","doi-asserted-by":"crossref","unstructured":"Gustafson, S.-\u00c5., Kortanek, K.: Semi-infinite programming and applications. In: Mathematical Programming The State of the Art, pp 132\u2013157. Springer, Berlin (1983)","DOI":"10.1007\/978-3-642-68874-4_7"},{"issue":"5","key":"1192_CR12","doi-asserted-by":"publisher","first-page":"2442","DOI":"10.1137\/090754595","volume":"20","author":"W Hare","year":"2010","unstructured":"Hare, W., Sagastiz\u00e1bal, C.: A redistributed proximal bundle method for nonconvex optimization. SIAM J. Optim. 20 (5), 2442\u20132473 (2010)","journal-title":"SIAM J. Optim."},{"key":"1192_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-015-9762-4","volume":"63","author":"W Hare","year":"2016","unstructured":"Hare, W., Sagastiz\u00e1bal, C., Solodov, M.: A proximal bundle method for nonsmooth nonconvex functions with inexact information. Comput. Optim. Appl. 63, 1\u201328 (2016)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"1192_CR14","doi-asserted-by":"publisher","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 (3), 354\u2013361 (1986)","journal-title":"Math. Program."},{"issue":"3","key":"1192_CR15","first-page":"380","volume":"35","author":"R Hettich","year":"1993","unstructured":"Hettich, R., Kortanek, K.O.: Semi-infinite programming: theory, methods, and applications. Soc. Ind. Appl. Math. 35 (3), 380\u2013429 (1993)","journal-title":"Soc. Ind. Appl. Math."},{"key":"1192_CR16","doi-asserted-by":"crossref","unstructured":"Hoseini Monjezi, N., Nobakhtian, S.: A filter proximal bundle method for nonsmooth nonconvex constrained optimization. J. Glob. Optim. (2020)","DOI":"10.1007\/s10898-020-00939-3"},{"key":"1192_CR17","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10589-019-00115-8","volume":"74","author":"N Hoseini Monjezi","year":"2019","unstructured":"Hoseini Monjezi, N., Nobakhtian, S.: A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization. Comput Optim Appl. 74, 443\u2013480 (2019)","journal-title":"Comput Optim Appl."},{"key":"1192_CR18","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10107-007-0123-7","volume":"116","author":"E Karas","year":"2009","unstructured":"Karas, E., Ribeiro, A., Sagastiz\u00e1bal, C., Solodov, M.: A bundle-filter method for nonsmooth convex constrained optimization. Math. Program. 116, 297\u2013320 (2009)","journal-title":"Math. Program."},{"key":"1192_CR19","unstructured":"Karmitsa, N.: Test problems for large-scale nonsmooth minimization. Reports of the Department of Mathematical Information Technology, Series B, Scientific computing, No. B 4\/2007 (2007)"},{"key":"1192_CR20","volume-title":"Methods of Descent for Nondifferentiable Optimization, vol. 1133","author":"KC Kiwiel","year":"2006","unstructured":"Kiwiel, K.C.: Methods of Descent for Nondifferentiable Optimization, vol. 1133. Springer, Berlin, Heidelberg (2006)"},{"issue":"4","key":"1192_CR21","doi-asserted-by":"publisher","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 (4), 901\u2013918 (1993)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1192_CR22","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.ejor.2006.08.045","volume":"180","author":"M L\u00f3pez","year":"2007","unstructured":"L\u00f3pez, M., Still, G.: Semi-infinite programming. Eur. J. Oper. Res. 180 (2), 491\u2013518 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"1192_CR23","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s10898-017-0565-2","volume":"70","author":"J Lv","year":"2018","unstructured":"Lv, J., Pang, L.P., Meng, F.Y.: A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information. J. Global Optim. 70, 517\u2013549 (2018)","journal-title":"J. Global Optim."},{"key":"1192_CR24","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s11075-018-0490-6","volume":"80","author":"J Lv","year":"2019","unstructured":"Lv, J., Pang, L.P., Xu, N., Xiao, Z.H.: An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems. Numer. Algorithms 80, 397\u2013427 (2019)","journal-title":"Numer. Algorithms"},{"key":"1192_CR25","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s10898-016-0490-9","volume":"68","author":"FY Meng","year":"2017","unstructured":"Meng, F.Y., Pang, L.P., Lv, J., Wang, J.H.: An approximate bundle method for solving nonsmooth equilibrium problems. J. Global Optim. 68, 537\u2013562 (2017)","journal-title":"J. Global Optim."},{"issue":"6","key":"1192_CR26","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1137\/0315061","volume":"15","author":"R Mifflin","year":"1977","unstructured":"Mifflin, R.: Semismooth and semiconvex functions in constrained optimization. SAIM J. Control Optim. 15 (6), 959\u2013972 (1977)","journal-title":"SAIM J. Control Optim."},{"issue":"10-11","key":"1192_CR27","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1080\/02331934.2010.527970","volume":"60","author":"A Mitsos","year":"2011","unstructured":"Mitsos, A.: Global optimization of semi-infinite programs via restriction of the right-hand side. Optimization 60 (10-11), 1291\u20131308 (2011)","journal-title":"Optimization"},{"key":"1192_CR28","unstructured":"Mitsos, A., Djelassi, H.: A Test Set of Semi-Infinite Programs. Process Systems Engineering (AVT.SVT), RWTH Aachen University, Aachen, Germany. http:\/\/web.mit.edu\/mitsos\/www\/pubs\/siptestset.pdf (2016)"},{"key":"1192_CR29","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/060674685","volume":"19","author":"A Mitsos","year":"2007","unstructured":"Mitsos, A., Lemonidis, P., Lee, C.K., Barton, P.I.: Relaxation-based bounds for semi-infinite programs. SIAM J. Optim. 19, 77\u2013113 (2007)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1192_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10898-014-0146-6","volume":"61","author":"A Mitsos","year":"2015","unstructured":"Mitsos, A., Tsoukalas, A.: Global optimization of generalized semi-infinite programs via restriction of the right hand side. J. Glob. Optim. 61 (1), 1\u201317 (2015)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"1192_CR31","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s10589-015-9810-0","volume":"64","author":"LP Pang","year":"2016","unstructured":"Pang, L.P., Lv, J., Wang, J.H.: Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems. Comput. Optim. Appl. 64 (2), 433\u2013465 (2016)","journal-title":"Comput. Optim. Appl."},{"key":"1192_CR32","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10589-020-00170-6","volume":"76","author":"L Pang","year":"2020","unstructured":"Pang, L., Wu, Q., Wang, J., et al.: A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods. Comput Optim Appl. 76, 125\u2013153 (2020)","journal-title":"Comput Optim Appl."},{"key":"1192_CR33","volume-title":"Introduction to Optimization","author":"BT Polyak","year":"1987","unstructured":"Polyak, B.T.: Introduction to Optimization. Optimization Software, Inc., Publications Division, New York (1987)"},{"key":"1192_CR34","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1137\/S1056263493260386","volume":"8","author":"B Rustem","year":"1998","unstructured":"Rustem, B., Nguyen, Q.: An algorithm for the inequality-constrained discrete min-max problem. SIAM J. Optim. 8, 265\u2013283 (1998)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1192_CR35","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/040603875","volume":"16","author":"C Sagastiz\u00e1bal","year":"2005","unstructured":"Sagastiz\u00e1bal, C., Solodov, M.: An infeasible bundle method for nonsmooth convex constrained optimization without a penalty function or a filter. SIAM J. Optim. 16 (1), 146\u2013169 (2005)","journal-title":"SIAM J. Optim."},{"key":"1192_CR36","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10589-011-9452-9","volume":"53","author":"TJ Shiu","year":"2012","unstructured":"Shiu, T.J., Wu, S.Y.: Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems. Comput Optim Appl. 53, 91\u2013113 (2012)","journal-title":"Comput Optim Appl."},{"key":"1192_CR37","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1090\/S0002-9947-1981-0597868-8","volume":"264","author":"JE Spingarn","year":"1981","unstructured":"Spingarn, J.E.: Submonotone subdifferentials of Lipschitz functions. Trans. Am. Math. Soc. 264, 77\u201389 (1981)","journal-title":"Trans. Am. Math. Soc."},{"key":"1192_CR38","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10107-012-0556-5","volume":"136","author":"O Stein","year":"2012","unstructured":"Stein, O., Steuermann, P.: The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets. Math. Program. 136, 183\u2013207 (2012)","journal-title":"Math. Program."},{"issue":"1","key":"1192_CR39","doi-asserted-by":"publisher","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. Programm. 91 (1), 53\u201369 (2001)","journal-title":"Math. Programm."},{"key":"1192_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11075-012-9692-5","volume":"65","author":"C Tang","year":"2014","unstructured":"Tang, C., Liu, S., Jian, J., et al.: A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization. Numer Algor. 65, 1\u201322 (2014)","journal-title":"Numer Algor."},{"issue":"4","key":"1192_CR41","doi-asserted-by":"publisher","first-page":"2537","DOI":"10.1137\/140982143","volume":"25","author":"SX Wang","year":"2015","unstructured":"Wang, S.X., Yuan, Y.X.: Feasible method for semi-infinite programs. SIAM J. Optim. 25 (4), 2537\u20132560 (2015)","journal-title":"SIAM J. Optim."},{"key":"1192_CR42","doi-asserted-by":"publisher","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":"1192_CR43","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1007\/s10957-014-0523-9","volume":"163","author":"Y Yang","year":"2014","unstructured":"Yang, Y., Pang, L., Ma, X., et al.: Constrained Nonconvex Nonsmooth Optimization via Proximal Bundle Method. J Optim Theory Appl. 163, 900\u2013925 (2014)","journal-title":"J Optim Theory Appl."},{"issue":"6","key":"1192_CR44","doi-asserted-by":"publisher","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 (6), 2959\u20132977 (2010)","journal-title":"SIAM J. Optim."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-021-01192-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-021-01192-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-021-01192-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T10:48:57Z","timestamp":1650278937000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-021-01192-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,22]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["1192"],"URL":"https:\/\/doi.org\/10.1007\/s11075-021-01192-9","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,22]]},"assertion":[{"value":"13 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}