{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:59:12Z","timestamp":1772297952543,"version":"3.50.1"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,2,10]],"date-time":"2018-02-10T00:00:00Z","timestamp":1518220800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Huzhou science and technology plan","award":["No.2016GY03."],"award-info":[{"award-number":["No.2016GY03."]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s11075-018-0490-6","type":"journal-article","created":{"date-parts":[[2018,2,10]],"date-time":"2018-02-10T06:52:08Z","timestamp":1518245528000},"page":"397-427","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems"],"prefix":"10.1007","volume":"80","author":[{"given":"Jian","family":"Lv","sequence":"first","affiliation":[]},{"given":"Li-Ping","family":"Pang","sequence":"additional","affiliation":[]},{"given":"Na","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Ze-Hao","family":"Xiao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,2,10]]},"reference":[{"key":"490_CR1","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":"490_CR2","volume-title":"Numerical Optimization: Theoretical and Pratical Aspects","author":"JF Bonnans","year":"2000","unstructured":"Bonnans, J.F., Gilbert, J.C., Lemarchal, C., Sagastizbal, C.: Numerical Optimization: Theoretical and Pratical Aspects, 2nd edn. Springer, Berlin (2000)","edition":"2"},{"key":"490_CR3","doi-asserted-by":"publisher","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":"490_CR4","volume-title":"Nonsmooth Analysis and Control Theory","author":"FH Clarke","year":"1998","unstructured":"Clarke, F.H., Ledyaev, Y.u.S., Stern, R.J., Wolenski, P.R.: Nonsmooth Analysis and Control Theory. Springer, New York (1998)"},{"key":"490_CR5","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF01585170","volume":"62","author":"R Correa","year":"1993","unstructured":"Correa, R., Lemar\u00e9chal, C.: Convergence of some algorithms for convex minimization. Math. Program. 62, 261\u2013275 (1993)","journal-title":"Math. Program."},{"key":"490_CR6","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1051\/cocv:2000104","volume":"5","author":"C Ferrier","year":"2000","unstructured":"Ferrier, C.: Computation of the distance to semi-algebraic sets. ESAIM Control Optim. Calc. Var. 5, 139\u2013156 (2000)","journal-title":"ESAIM Control Optim. Calc. Var."},{"key":"490_CR7","volume-title":"A Bundle Filter Method for Nonsmooth Nonlinear Optimization, Numerical Analysis Report NA\/195, Department of Mathematics","author":"R Fletcher","year":"1999","unstructured":"Fletcher, R., Leyffer, S.: A Bundle Filter Method for Nonsmooth Nonlinear Optimization, Numerical Analysis Report NA\/195, Department of Mathematics. The University of Dundee, Scotland (1999)"},{"key":"490_CR8","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s101070100244","volume":"91","author":"R Fletcher","year":"2002","unstructured":"Fletcher, R., Leyffer, S.: Nonlinear programming without a penalty function. Math. Program. 91, 239\u2013269 (2002)","journal-title":"Math. Program."},{"key":"490_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":"490_CR10","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1080\/10556780410001648112","volume":"19","author":"A Fuduli","year":"2004","unstructured":"Fuduli, A., Gaudioso, M., Giallombardo, G.: A DC piecewise and model and a bundling technique in nonconvex nonsmooth minimization. Optim. Methods Softw. 19, 89\u2013102 (2004)","journal-title":"Optim. Methods Softw."},{"key":"490_CR11","volume-title":"Linear Semi-infinite Optimization","author":"MA Goberna","year":"1998","unstructured":"Goberna, M.A., L\u00f3pez, M.A.: Linear Semi-infinite Optimization. Wiley, New-York (1998)"},{"key":"490_CR12","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10107-006-0728-2","volume":"109","author":"N Haarala","year":"2007","unstructured":"Haarala, N., Miettinen, K., M\u00e4kel\u00e4, M.M.: Globally convergent limited memory bundle method for large-scale nonsmooth optimization. Math. Program. 109, 181\u2013205 (2007)","journal-title":"Math. Program."},{"key":"490_CR13","first-page":"589","volume":"14","author":"W Hare","year":"2007","unstructured":"Hare, W., Poliquin, R.A.: Prox-regularity and stability of the proximal mapping. J. Convex Anal. 14, 589\u2013606 (2007)","journal-title":"J. Convex Anal."},{"key":"490_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10107-007-0124-6","volume":"116","author":"W Hare","year":"2009","unstructured":"Hare, W., Sagastizbal, C.: Computing proximal points of nonconvex functions. Math Program. 116, 221\u2013258 (2009)","journal-title":"Math Program."},{"key":"490_CR15","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 bundlemethod for nonconvex optimization. SIAM J. Optim. 20, 2442\u20132473 (2010)","journal-title":"SIAM J. Optim."},{"key":"490_CR16","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."},{"key":"490_CR17","doi-asserted-by":"publisher","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":"490_CR18","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1080\/02331930902884398","volume":"59","author":"N Karmitsa","year":"2010","unstructured":"Karmitsa, N., M\u00e4kel\u00e4, M.M.: Adaptive limited memory bundle method for bound constrained largescale nonsmooth optimization. Optimization 59, 945\u2013962 (2010)","journal-title":"Optimization"},{"key":"490_CR19","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1080\/10556780902842495","volume":"25","author":"N Karmitsa","year":"2010","unstructured":"Karmitsa, N., M\u00e4kel\u00e4, M.M.: Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis. Optim. Methods Softw. 25, 895\u2013916 (2010)","journal-title":"Optim. Methods Softw."},{"key":"490_CR20","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/j.amc.2007.08.044","volume":"198","author":"N Karmitsa","year":"2008","unstructured":"Karmitsa, N., M\u00e4kel\u00e4, M.M., Ali, M.M.: Limited memory interior point bundle method for large inequality constrained nonsmooth minimization. Appl. Math. Comput. 198, 382\u2013400 (2008)","journal-title":"Appl. Math. Comput."},{"key":"490_CR21","doi-asserted-by":"publisher","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-Verlag, Berlin (1985)"},{"key":"490_CR22","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1093\/imanum\/5.1.111","volume":"5","author":"KC Kiwiel","year":"1985","unstructured":"Kiwiel, K.C.: An exact penalty function algorithm for nonsmooth convex constrained minimization problems. IMA J. Numer. Anal. 5, 111\u2013119 (1985)","journal-title":"IMA J. Numer. Anal."},{"key":"490_CR23","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BF01582892","volume":"52","author":"KC Kiwiel","year":"1991","unstructured":"Kiwiel, K.C.: Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization. Math. Program. 52, 285\u2013302 (1991)","journal-title":"Math. Program."},{"key":"490_CR24","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, 901\u2013918 (1993)","journal-title":"SIAM J. Optim."},{"key":"490_CR25","unstructured":"Kuntsevich, A., Kappel, F.: SolvOpt-The solver for local nonlinear optimization problems: Matlab, C and fortran source codes, institute for mathematics. Karl-Franzens University of Graz (1997)"},{"key":"490_CR26","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01585555","volume":"69","author":"C Lemar\u00e9chal","year":"1995","unstructured":"Lemar\u00e9chal, C., Nemirovskii, A., Nesterov, Y.: New variants of bundle methods. Math. Program. 69, 111\u2013147 (1995)","journal-title":"Math. Program."},{"key":"490_CR27","doi-asserted-by":"publisher","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":"490_CR28","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":"490_CR29","doi-asserted-by":"publisher","DOI":"10.1142\/1493","volume-title":"Nonsmooth Optimization: Analysis and Algorithms with Applications to Optimal Control","author":"MM M\u00e4kel\u00e4","year":"1992","unstructured":"M\u00e4kel\u00e4, M.M., Neittaanm\u00e4ki, P.: Nonsmooth Optimization: Analysis and Algorithms with Applications to Optimal Control. World Scientific Publishing Co., Singapore (1992)"},{"key":"490_CR30","doi-asserted-by":"crossref","unstructured":"M\u00e4kel\u00e4, M.M., Karmitsa, N., Wilppu, O.: Proximal bundle method for nonsmooth and nonconvex multiobjective optimization. In: Tuovinen, T., Repin, S., Neittaanm\u00e4ki, P. (eds.) Mathematical Modeling and Optimization of Complex Structures. Computational Methods in Applied Sciences, vol. 40, pp 191\u2013204. Springer (2016)","DOI":"10.1007\/978-3-319-23564-6_12"},{"key":"490_CR31","doi-asserted-by":"publisher","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":"490_CR32","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1287\/moor.2.2.191","volume":"2","author":"R Mifflin","year":"1977","unstructured":"Mifflin, R.: An algorithm for constrained optimization with semismooth functions. Math. Oper. Res. 2, 191\u2013207 (1977)","journal-title":"Math. Oper. Res."},{"key":"490_CR33","doi-asserted-by":"publisher","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":"490_CR34","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, 433\u2013465 (2016)","journal-title":"Comput. Optim. Appl."},{"key":"490_CR35","doi-asserted-by":"publisher","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":"490_CR36","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press (1970)","DOI":"10.1515\/9781400873173"},{"key":"490_CR37","volume-title":"Variational Analysis, Volume 317 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, J.J.-B.: Variational Analysis, Volume 317 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Springer, Berlin (1998)"},{"key":"490_CR38","doi-asserted-by":"crossref","unstructured":"R\u00fcckmann, J.-J., Stein, O.: On convex lower level problems in generalized semi-infinite optimization. In: Goberna, M. A., L\u00f3pez, M. A. (eds.) Semi-infinite Programming Recent Advances, pp 121\u2013134. Kluwer, Dordrecht (2001)","DOI":"10.1007\/978-1-4757-3403-4_6"},{"key":"490_CR39","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, 146\u2013169 (2005)","journal-title":"SIAM J. Optim."},{"key":"490_CR40","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1137\/0802008","volume":"2","author":"H Schramm","year":"1992","unstructured":"Schramm, H., Zowe, J.: A version of the bundle idea for minimizing a nonsmooth function: Conceptual idea, convergence analysis, numerical results. SIAM J. Optim. 2, 121\u2013152 (1992)","journal-title":"SIAM J. Optim."},{"key":"490_CR41","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1016\/S0377-2217(01)00307-1","volume":"142","author":"O Stein","year":"2002","unstructured":"Stein, O., Still, G.: On generalized semi-infinite optimization and bilevel optimization. European J. Oper. Res. 142, 444\u2013462 (2002)","journal-title":"European J. Oper. Res."},{"key":"490_CR42","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9164-5","volume-title":"Bi-level Strategies in Semi-infinite Programming","author":"O Stein","year":"2003","unstructured":"Stein, O.: Bi-level Strategies in Semi-infinite Programming. Kluwer, Boston (2003)"},{"key":"490_CR43","doi-asserted-by":"publisher","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":"490_CR44","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. Program. 91, 53\u201369 (2001)","journal-title":"Math. Program."},{"key":"490_CR45","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1023\/A:1019260508329","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":"490_CR46","doi-asserted-by":"publisher","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. Probl. Optim. 19, 803\u2013817 (1988)","journal-title":"Probl. Optim."},{"key":"490_CR47","doi-asserted-by":"publisher","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 Soft. 20, 629\u2013643 (2005)","journal-title":"Optim, Methods Soft."},{"key":"490_CR48","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.P., Ma, X.F., Shen, J.: Constrained nonconvex nonsmooth optimization via proximal bundle method. J. Optim. Theory Appl. 163, 900\u2013925 (2014)","journal-title":"J. Optim. Theory Appl."},{"key":"490_CR49","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, 2959\u20132977 (2010)","journal-title":"SIAM J. Optim."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-018-0490-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-018-0490-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-018-0490-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,28]],"date-time":"2020-10-28T01:18:09Z","timestamp":1603847889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-018-0490-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,10]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["490"],"URL":"https:\/\/doi.org\/10.1007\/s11075-018-0490-6","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,10]]},"assertion":[{"value":"1 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}