{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T11:01:13Z","timestamp":1780657273324,"version":"3.54.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T00:00:00Z","timestamp":1682380800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T00:00:00Z","timestamp":1682380800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Najmeh Hoseini Monjezi","award":["The research was supported by a grant from IPM."],"award-info":[{"award-number":["The research was supported by a grant from IPM."]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s11075-023-01519-8","type":"journal-article","created":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T15:28:05Z","timestamp":1682436485000},"page":"765-787","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information"],"prefix":"10.1007","volume":"94","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1431-0520","authenticated-orcid":false,"given":"N.","family":"Hoseini Monjezi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2488-7892","authenticated-orcid":false,"given":"S.","family":"Nobakhtian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,4,25]]},"reference":[{"key":"1519_CR1","doi-asserted-by":"publisher","first-page":"2567","DOI":"10.1023\/A:1023227716953","volume":"115","author":"AM Bagirov","year":"2003","unstructured":"Bagirov, A.M.: Continuous subdifferential approximations and their applications. J. Math. Sci., 115, 2567\u20132609 (2003)","journal-title":"J. Math. Sci."},{"key":"1519_CR2","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s10589-021-00304-4","volume":"80","author":"AM Bagirov","year":"2021","unstructured":"Bagirov, A.M., Hoseini Monjezi, N., Taheri, S.: An augmented subgradient method for minimizing nonsmooth DC functions. Comput. Optim. Appl. 80, 411\u2013438 (2021)","journal-title":"Comput. Optim. Appl."},{"key":"1519_CR3","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/s10957-012-0167-6","volume":"157","author":"Subgradient method for nonconvex nonsmooth optimization","year":"2013","unstructured":"Bagirov, A.M., Jin, L., Karmitsa, N., Nuaimat, A.Al., Sultanova N.: Subgradient method for nonconvex nonsmooth optimization. J. Optim. Theory Appl., 157, 416\u2013435 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"1519_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08114-4","volume-title":"Introduction to Nonsmooth Optimization: theory, practice and software","author":"AM Bagirov","year":"2014","unstructured":"Bagirov, A.M., Karmitsa, N., M\u00e4kel\u00e4, M.M.: Introduction to Nonsmooth Optimization: theory, practice and software. Springer (2014)"},{"key":"1519_CR5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s11590-020-01586-z","volume":"15","author":"AM Bagirov","year":"2021","unstructured":"Bagirov, A.M., Taheri, S., Joki, K., Karmitsa, N., M\u00e4kel\u00e4, M.M.: Aggregate subgradient method for nonsmooth DC optimization. Optim. Lett., 15, 83\u201396 (2021)","journal-title":"Optim. Lett."},{"key":"1519_CR6","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1137\/030601296","volume":"15","author":"J Burke","year":"2005","unstructured":"Burke, J., Lewis, A., Overton, M.: A robust gradient sampling algorithm for nonsmooth, nonconvex optimization. SIAM J. Optim., 15, 571\u2013779 (2005)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1519_CR7","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(2), 474\u2013500 (2012)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"1519_CR8","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s10107-014-0809-6","volume":"148","author":"W de Oliveira","year":"2014","unstructured":"de Oliveira, W., Sagastiz\u00e1bal, C., Lemar\u00e9chal, C.: Convex proximal bundle methods in depth: a unified analysis for inexact oracles. Math. Program., 148(1\u20132), 241\u2013277 (2014)","journal-title":"Math. Program."},{"issue":"2","key":"1519_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(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"1519_CR10","volume-title":"Bornes Duales de Probl\u00e9mes d\u2019Optimisation Polynomiaux","author":"C Ferrier","year":"1997","unstructured":"Ferrier, C.: Bornes Duales de Probl\u00e9mes d\u2019Optimisation Polynomiaux, Ph.D. thesis, Laboratoire Approximation et Optimisation, Universit\u00e9 Paul Sabatier, France (1997)"},{"key":"1519_CR11","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":"1519_CR12","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":"1519_CR13","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":"1519_CR14","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":"1519_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10898-020-00939-3","volume":"79","author":"N Hoseini Monjezi","year":"2021","unstructured":"Hoseini Monjezi, N., Nobakhtian, S.: A filter proximal bundle method for nonsmooth nonconvex constrained optimization. J. Glob. Opti., 79, 1\u201337 (2021)","journal-title":"J. Glob. Opti."},{"issue":"2","key":"1519_CR16","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(2), 443\u2013480 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"1519_CR17","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s11075-021-01128-3","volume":"89","author":"N Hoseini Monjezi","year":"2022","unstructured":"Hoseini Monjezi, N., Nobakhtian, S.: A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data. Numer. Algor., 89, 637\u2013674 (2022)","journal-title":"Numer. Algor."},{"key":"1519_CR18","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1007\/s10479-020-03808-0","volume":"311","author":"N Hoseini Monjezi","year":"2022","unstructured":"Hoseini Monjezi, N., Nobakhtian, S.: An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems. Ann. Oper. Res., 311, 1123\u20131154 (2022)","journal-title":"Ann. Oper. Res."},{"key":"1519_CR19","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1007\/s11590-021-01787-0","volume":"16","author":"N Hoseini Monjezi","year":"2022","unstructured":"Hoseini Monjezi, N., Nobakhtian, S.: Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems. Optim. Lett., 16, 1495\u20131511 (2022)","journal-title":"Optim. Lett."},{"key":"1519_CR20","doi-asserted-by":"crossref","unstructured":"Hoseini Monjezi, N., Nobakhtian, S. Pouryayevali, M.R.: Proximal bundle algorithm for nonsmooth optimization on riemannian manifolds, IMA J. Numer. Anal., 43(1), 293\u2013325 (2023)","DOI":"10.1093\/imanum\/drab091"},{"key":"1519_CR21","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/BF02191984","volume":"84","author":"KC Kiwiel","year":"1995","unstructured":"Kiwiel, K.C.: Approximations in proximal bundle methods and decomposition of convex programs. J. Optim. Theory Appl., 84, 529\u2013548 (1995)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1519_CR22","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1137\/S1052623400376366","volume":"14","author":"KC Kiwiel","year":"2004","unstructured":"Kiwiel, K.C.: Convergence of approximate and incremental subgradient methods for convex optimization. SIAM. J. Optim., 14(3), 807\u2013840 (2004)","journal-title":"SIAM. J. Optim."},{"key":"1519_CR23","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1137\/050639673","volume":"18","author":"KC Kiwiel","year":"2007","unstructured":"Kiwiel, K.C.: Convergence of the gradient sampling algorithm for nonsmooth nonconvex optimization. SIAM J. Optim., 18, 379\u2013388 (2007)","journal-title":"SIAM J. Optim."},{"key":"1519_CR24","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1023\/A:1004689609425","volume":"104","author":"KC Kiwiel","year":"2000","unstructured":"Kiwiel, K.C.: Efficiency of Proximal Bundle Methods. J. Optim. Theory Appl., 104, 589\u2013603 (2000)","journal-title":"J. Optim. Theory Appl."},{"key":"1519_CR25","unstructured":"Lemar\u00e9chal, C.: Bundle methods in nonsmooth optimization, in: Nonsmooth Optimization (Laxenburg, 1977), Lemar\u00e9chal C., Mifflin, R. (eds.), IIASA Proc. Ser. 3, Pergamon Press, Oxford, 79\u2013102 (1978)"},{"issue":"1\u20132","key":"1519_CR26","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10107-012-0514-2","volume":"141","author":"AS Lewis","year":"2013","unstructured":"Lewis, A.S., Overton, M.L.: Nonsmooth Optimization via Quasi-Newton Methods. Math. Program., 141(1\u20132), 135\u2013163 (2013)","journal-title":"Math. Program."},{"key":"1519_CR27","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, LP., Xu, N., Xiao, Z.H.: An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems. Numer. Algor., 80, 397\u2013427 (2019)","journal-title":"Numer. Algor."},{"key":"1519_CR28","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)"},{"issue":"1","key":"1519_CR29","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10107-007-0149-x","volume":"120","author":"Y Nesterov","year":"2009","unstructured":"Nesterov, Y.: Primal-dual subgradient methods for convex problems. Math. Program., 120(1), 221\u2013259 (2009)","journal-title":"Math. Program."},{"key":"1519_CR30","doi-asserted-by":"crossref","unstructured":"Noll, D.: Bundle method for non-convex minimization with inexact subgradients and function values. In: Computational and Analytical Mathematics, vol. 50, pp. 555\u2013592. Springer Proceedings in Mathematics (2013)","DOI":"10.1007\/978-1-4614-7621-4_26"},{"key":"1519_CR31","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":"1519_CR32","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s11075-021-01192-9","volume":"90","author":"LP Pang","year":"2022","unstructured":"Pang, LP., Wu, Q.: A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming. Numer. Algor., 90, 387\u2013422 (2022)","journal-title":"Numer. Algor."},{"key":"1519_CR33","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF01581136","volume":"66","author":"L Qi","year":"1994","unstructured":"Qi, L., Sun, J.: A trust region algorithm for minimization of locally Lipschitzian functions. Math. Program., 66, 25\u201343 (1994)","journal-title":"Math. Program."},{"key":"1519_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 (1985)"},{"key":"1519_CR35","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1023\/A:1022680114518","volume":"98","author":"MV Solodov","year":"1998","unstructured":"Solodov, M.V., Zavriev, S.K.: Error stability properties of generalized gradient-type algorithms. J. Optim. Theory Appl., 98, 663\u2013680 (1998)","journal-title":"J. Optim. Theory Appl."},{"key":"1519_CR36","doi-asserted-by":"crossref","unstructured":"Tang, C., Liu, S., Jian, J., Li. J.: A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization. Numer. Algor., 65, 1\u201322 (2014)","DOI":"10.1007\/s11075-012-9692-5"},{"key":"1519_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":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-023-01519-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-023-01519-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-023-01519-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,5]],"date-time":"2023-09-05T09:17:32Z","timestamp":1693905452000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-023-01519-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,25]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["1519"],"URL":"https:\/\/doi.org\/10.1007\/s11075-023-01519-8","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,25]]},"assertion":[{"value":"30 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"Not applicable","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animal ethics"}},{"value":"The authors declare no competing interests.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}