{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T20:17:27Z","timestamp":1772396247474,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T00:00:00Z","timestamp":1560556800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T00:00:00Z","timestamp":1560556800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"IPM","award":["No 98900417"],"award-info":[{"award-number":["No 98900417"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s10589-019-00115-8","type":"journal-article","created":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T07:03:05Z","timestamp":1560582185000},"page":"443-480","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization"],"prefix":"10.1007","volume":"74","author":[{"given":"Najmeh","family":"Hoseini Monjezi","sequence":"first","affiliation":[]},{"given":"S.","family":"Nobakhtian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,15]]},"reference":[{"key":"115_CR1","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/BF01584657","volume":"4","author":"J Asaadi","year":"1973","unstructured":"Asaadi, J.: A computational comparison of some non-linear programs. Math. Program. 4, 144\u2013154 (1973)","journal-title":"Math. Program."},{"key":"115_CR2","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/s11081-017-9366-1","volume":"18","author":"V Beiranvand","year":"2017","unstructured":"Beiranvand, V., Hare, W., Lucet, Y.: Best practices for comparing optimization algorithms. Optim. Eng. 18, 815\u2013848 (2017)","journal-title":"Optim. Eng."},{"key":"115_CR3","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)"},{"key":"115_CR4","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":"115_CR5","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1137\/090780201","volume":"22","author":"FE Curtis","year":"2012","unstructured":"Curtis, F.E., Overton, M.L.: A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization. SIAM J. Optim. 22, 474\u2013500 (2012)","journal-title":"SIAM J. Optim."},{"key":"115_CR6","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, 292\u2013301 (2004)","journal-title":"J. Math. Anal. Appl."},{"key":"115_CR7","first-page":"1061","volume":"22","author":"MN Dao","year":"2015","unstructured":"Dao, M.N.: Bundle method for nonconvex nonsmooth constrained optimization. J. Convex Anal. 22, 1061\u20131090 (2015)","journal-title":"J. Convex Anal."},{"key":"115_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10589-016-9834-0","volume":"65","author":"MN Dao","year":"2016","unstructured":"Dao, M.N., Gwinner, J., Noll, D., Ovcharova, N.: Nonconvex bundle method with application to a delamination problem. Comput. Optim. Appl. 65, 173\u2013203 (2016)","journal-title":"Comput. Optim. Appl."},{"key":"115_CR9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"115_CR10","unstructured":"Ferrier, C.: Bornes Dualse de Problemes d\u2019Optimisation Polynomiaux. Ph.D. thesis, Laboratoire Approximation et Optimisation, Universite Paul, Toulouse (1997)"},{"key":"115_CR11","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s00498-012-0093-z","volume":"25","author":"M Gabarrou","year":"2013","unstructured":"Gabarrou, M., Alazard, D., Noll, D.: Design of a flight control architecture using a non-convex bundle method. Math. Control Signals Syst. 25, 257\u2013290 (2013)","journal-title":"Math. Control Signals Syst."},{"key":"115_CR12","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10107-007-0124-6","volume":"116","author":"W Hare","year":"2009","unstructured":"Hare, W., Sagastiz\u00e1bal, C.: Computing proximal points of nonconvex functions. Math. Program. 116, 221\u2013258 (2009)","journal-title":"Math. Program."},{"key":"115_CR13","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, 2442\u20132473 (2010)","journal-title":"SIAM J. Optim."},{"key":"115_CR14","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":"115_CR15","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1023\/A:1011259017643","volume":"20","author":"M Hinterm\u00fcller","year":"2001","unstructured":"Hinterm\u00fcller, M.: A proximal bundle method based on approximate subgradients. Comput. Optim. Appl. 20, 245\u2013266 (2001)","journal-title":"Comput. Optim. Appl."},{"key":"115_CR16","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty, J.B., Lemar\u00e9chal, C.: Convex analysis and minimization algorithms II. In: Advanced Theory and Bundle Methods. vol. 306 of Grundlehren der mathematischen Wissenschaften (1993)","DOI":"10.1007\/978-3-662-06409-2"},{"key":"115_CR17","doi-asserted-by":"publisher","first-page":"1265","DOI":"10.1080\/02331934.2018.1470175","volume":"67","author":"N Hoseini","year":"2018","unstructured":"Hoseini, N., Nobakhtian, S.: A new trust region method for nonsmooth nonconvex optimization. Optimization 67, 1265\u20131286 (2018)","journal-title":"Optimization"},{"key":"115_CR18","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10898-016-0488-3","volume":"68","author":"K Joki","year":"2017","unstructured":"Joki, K., Bagirov, A.M., Karmitsa, N., M\u00e4kel\u00e4, M.M.: A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes. J. Glob. Optim. 68, 501\u2013535 (2017)","journal-title":"J. Glob. Optim."},{"key":"115_CR19","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. Ser. B 116, 297\u2013320 (2009)","journal-title":"Math. Program. Ser. B"},{"key":"115_CR20","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1287\/moor.10.2.185","volume":"10","author":"KC Kiwiel","year":"1985","unstructured":"Kiwiel, K.C.: A linearization algorithm for nonsmooth minimization. Math. Oper. Res. 10, 185\u2013194 (1985)","journal-title":"Math. Oper. Res."},{"key":"115_CR21","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BFb0074507","volume-title":"Methods of Descent for Nondifferentiable Optimization","author":"Krzysztof C. Kiwiel","year":"1985","unstructured":"Kiwiel, K.C.: Methods of Descent for Nondifferentiable Optimization. Lecture Notes in Mathematics, vol. 1133. Springer, Berlin (1985)"},{"key":"115_CR22","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/0806013","volume":"6","author":"KC Kiwiel","year":"1996","unstructured":"Kiwiel, K.C.: Restricted step and Levenberg\u2013Marquardt techniques in proximal bundle methods for nonconvex nondifferentiable optimization. SIAM J. Optim. 6, 227\u2013249 (1996)","journal-title":"SIAM J. Optim."},{"key":"115_CR23","first-page":"79","volume-title":"Nonsmooth Optimization (Laxenburg, 1977), IIASA Proc. Ser.","author":"C Lemar\u00e9chal","year":"1978","unstructured":"Lemar\u00e9chal, C.: Bundle methods in nonsmooth optimization. In: Lemar\u00e9chal, C., Mifflin, R. (eds.) Nonsmooth Optimization (Laxenburg, 1977), IIASA Proc. Ser., vol. 3, pp. 79\u2013102. Pergamon Press, Oxford (1978)"},{"key":"115_CR24","first-page":"112","volume-title":"Lecture Notes in Computer Science","author":"Claude Lemar\u00e9chal","year":"2001","unstructured":"Lemar\u00e9chal, C.: Lagrangian relaxation. In: Computational Combinatorial Optimization, Lecture Notes in Computer Science, vol. 2241, pp. 112\u2013156. Springer, Berlin (2001)"},{"key":"115_CR25","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s10898-017-0565-2","volume":"70","author":"J Lv","year":"2017","unstructured":"Lv, J., Pang, L.P., Meng, F.Y.: A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information. J. Glob. Optim. 70, 517\u2013549 (2017)","journal-title":"J. Glob. Optim."},{"key":"115_CR26","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. Algorithm 80, 397\u2013427 (2019)","journal-title":"Numer. Algorithm"},{"key":"115_CR27","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, Singapore (1992)"},{"key":"115_CR28","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BFb0120960","volume-title":"Nondifferential and Variational Techniques in optimization (Lexington, 1980), Mathematical Programming Studies","author":"R Mifflin","year":"1982","unstructured":"Mifflin, R.: A modification and extension of Lemarechal\u2019s algorithm for nonsmooth minimization. In: Sorensen, D.C., Wets, R.B. (eds.) Nondifferential and Variational Techniques in optimization (Lexington, 1980), Mathematical Programming Studies, vol. 17, pp. 77\u201390. North-Holland, Amsterdam (1982)"},{"key":"115_CR29","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/080724083","volume":"20","author":"JJ Mor\u00e9","year":"2009","unstructured":"Mor\u00e9, J.J., Wild, S.: Benchmarking derivative-free optimization algorithms. SIAM J. Optim. 20, 172\u2013191 (2009)","journal-title":"SIAM J. Optim."},{"key":"115_CR30","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s11228-010-0159-3","volume":"18","author":"D Noll","year":"2010","unstructured":"Noll, D.: Cutting plane oracles to minimize non-smooth non-convex functions. Set-Valued Var. Anal. 18, 531\u2013568 (2010)","journal-title":"Set-Valued Var. Anal."},{"key":"115_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis. Springer, Berlin (1998)"},{"key":"115_CR32","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."},{"key":"115_CR33","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":"115_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-82118-9","volume-title":"Minimization Methods for Non-Differentiable Functions","author":"NZ Shor","year":"1985","unstructured":"Shor, N.Z.: Minimization Methods for Non-Differentiable Functions. Springer, Berlin (1985)"},{"key":"115_CR35","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":"115_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11075-012-9692-5","volume":"65","author":"CM Tang","year":"2014","unstructured":"Tang, C.M., Liu, S., Jian, J.B., Li, J.L.: A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization. Numer. Algorithms 65, 1\u201322 (2014)","journal-title":"Numer. Algorithms"},{"key":"115_CR37","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., Shen, J.: Constrained nonconvex nonsmooth optimization via proximal bundle method. J. Optim. Theory Appl. 163, 900\u2013925 (2014)","journal-title":"J. Optim. Theory Appl."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00115-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00115-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00115-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,13]],"date-time":"2020-06-13T23:24:40Z","timestamp":1592090680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00115-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,15]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["115"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00115-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,15]]},"assertion":[{"value":"23 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}