{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T19:55:56Z","timestamp":1775591756018,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T00:00:00Z","timestamp":1664496000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T00:00:00Z","timestamp":1664496000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004564","name":"Ministarstvo Prosvete, Nauke i Tehnolo\u0161kog Razvoja","doi-asserted-by":"publisher","award":["\u202a451-03-9\/2021-14\/ 200125"],"award-info":[{"award-number":["\u202a451-03-9\/2021-14\/ 200125"]}],"id":[{"id":"10.13039\/501100004564","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004564","name":"Ministarstvo Prosvete, Nauke i Tehnolo\u0161kog Razvoja","doi-asserted-by":"publisher","award":["451-03-9\/2021-14\/ 200125"],"award-info":[{"award-number":["451-03-9\/2021-14\/ 200125"]}],"id":[{"id":"10.13039\/501100004564","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004564","name":"Ministarstvo Prosvete, Nauke i Tehnolo\u0161kog Razvoja","doi-asserted-by":"publisher","award":["451-03-68\/2020-14\/200156"],"award-info":[{"award-number":["451-03-68\/2020-14\/200156"]}],"id":[{"id":"10.13039\/501100004564","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s11075-022-01419-3","type":"journal-article","created":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T13:09:33Z","timestamp":1664543373000},"page":"347-365","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Spectral projected subgradient method for nonsmooth convex optimization problems"],"prefix":"10.1007","volume":"93","author":[{"given":"Nata\u0161a","family":"Kreji\u0107","sequence":"first","affiliation":[]},{"given":"Nata\u0161a","family":"Krklec Jerinki\u0107","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4712-0427","authenticated-orcid":false,"given":"Tijana","family":"Ostoji\u0107","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,30]]},"reference":[{"issue":"1","key":"1419_CR1","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s11228-015-0352-5","volume":"24","author":"P Apkarian","year":"2016","unstructured":"Apkarian, P., Noll, D., Ravanbod, L.: Nonsmooth bundle trust-region algorithm with applications to robust stability. Set-Valued Variational Anal. 24(1), 115\u2013148 (2016). https:\/\/doi.org\/10.1007\/s11228-015-0352-5","journal-title":"Set-Valued Variational Anal."},{"key":"1419_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08114-4","volume-title":"Introduction to Nonsmooth Optimization","author":"A Bagirov","year":"2014","unstructured":"Bagirov, A., Karmitsa, N., M\u00e4kel\u00e4, M.: Introduction to Nonsmooth Optimization. Springer, Berlin (2014). https:\/\/doi.org\/10.1007\/978-3-319-08114-4"},{"issue":"1","key":"1419_CR3","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10287-005-0044-y","volume":"3","author":"F Bastin","year":"2006","unstructured":"Bastin, F., Cirillo, C., Toint, P.L.: An adaptive Monte Carlo algorithm for computing mixed logit estimators. Comput. Manag. Sci. 3(1), 55\u201379 (2006). https:\/\/doi.org\/10.1007\/s10287-005-0044-y","journal-title":"Comput. Manag. Sci."},{"issue":"4","key":"1419_CR4","doi-asserted-by":"publisher","first-page":"2309","DOI":"10.1093\/imanum\/drz027","volume":"40","author":"S Bellavia","year":"2018","unstructured":"Bellavia, S., Kreji\u0107, N., Krklec Jerinki\u0107, N.: Subsampled Inexact Newton methods for minimizing large sums of convex function. IMA J. Numer. Anal. 40(4), 2309\u20132341 (2018). https:\/\/doi.org\/10.1093\/imanum\/drz027","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"1419_CR5","doi-asserted-by":"publisher","first-page":"19","DOI":"10.2478\/caim-2020-0002","volume":"11","author":"S Bellavia","year":"2020","unstructured":"Bellavia, S., Jerinki\u0107, N.K., Malaspina, G.: Subsampled nonmonotone spectral gradient methods. Commun. Appl. Ind. Math. 11(1), 19\u201334 (2020). https:\/\/doi.org\/10.2478\/caim-2020-0002","journal-title":"Commun. Appl. Ind. Math."},{"key":"1419_CR6","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1137\/S1052623497330963","volume":"10","author":"EG Birgin","year":"2000","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Raydan, M.: Nonmonotone spectral projected gradients on convex sets. SIAM J. Optim. 10, 1196\u20131211 (2000). https:\/\/doi.org\/10.1137\/S1052623497330963","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1419_CR7","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1287\/moor.27.3.567.317","volume":"27","author":"J Burke","year":"2002","unstructured":"Burke, J., Lewis, A., Overton, M.: Approximating subdifferentials by random sampling of gradients. Math. Oper. Res. 27(3), 567\u2013584 (2002). https:\/\/doi.org\/10.1287\/moor.27.3.567.317","journal-title":"Math. Oper. Res."},{"issue":"3","key":"1419_CR8","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/BF02614390","volume":"76","author":"C Lemarechal","year":"1997","unstructured":"Lemarechal, C., Sagastizabal, C.: Variable metric bundle methods: From conceptual to implementable forms. Math. Program. 76(3), 393\u2013410 (1997). https:\/\/doi.org\/10.1007\/BF02614390","journal-title":"Math. Program."},{"issue":"1","key":"1419_CR9","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02680566","volume":"83","author":"L Luk\u0161an","year":"1998","unstructured":"Luk\u0161an, L., Vl\u010dek, J.: A bundle-Newton method for nonsmooth unconstrained minimization. Math. Program. 83(1), 373\u2013391 (1998). https:\/\/doi.org\/10.1007\/BF02680566","journal-title":"Math. Program."},{"key":"1419_CR10","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., Ser. A 91, 201\u2013213 (2002). https:\/\/doi.org\/10.1007\/s101070100263","journal-title":"Math. Program., Ser. A"},{"issue":"3","key":"1419_CR11","doi-asserted-by":"publisher","first-page":"1628","DOI":"10.1137\/070707828","volume":"31","author":"MA Gomes-Ruggiero","year":"2009","unstructured":"Gomes-Ruggiero, M.A., Mart\u00ednez, J.M., Santos, S.A.: Spectral projected gradient method with inexact restoration for minimization with nonconvex constraints. SIAM J. Sci. Comput. 31(3), 1628\u20131652 (2009). https:\/\/doi.org\/10.1137\/070707828","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"1419_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), 1\u201328 (2016). https:\/\/doi.org\/10.1007\/s10589-015-9762-4","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"1419_CR13","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1145\/858481.858483","volume":"13","author":"T Homem-de-Mello","year":"2003","unstructured":"Homem-de-Mello, T.: Variable-sample methods for stochastic optimization. ACM Trans. Model. Comput. Simul. 13(2), 108\u2013133 (2003). https:\/\/doi.org\/10.1145\/858481.858483","journal-title":"ACM Trans. Model. Comput. Simul."},{"key":"1419_CR14","unstructured":"Lichman, M.: UCI machine learning repository. https:\/\/archive.ics.uci.edu\/ml\/index.php (2013)"},{"key":"1419_CR15","unstructured":"Jiang, Q.: Proximal bundle methods and nonlinear acceleration: An Exploration, Senior Thesis (2021)"},{"key":"1419_CR16","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10898-018-0682-6","volume":"73","author":"N Kreji\u0107","year":"2018","unstructured":"Kreji\u0107, N., Krklec Jerinki\u0107, N.: Spectral projected gradient method for stochastic optimization. J. Glob. Optim. 73, 59\u201381 (2018). https:\/\/doi.org\/10.1007\/s10898-018-0682-6","journal-title":"J. Glob. Optim."},{"key":"1419_CR17","unstructured":"Kreji\u0107, N., Krklec Jerinki\u0107, N., Ostoji\u0107, T.: Minimizing nonsmooth convex functions with variable accuracy. arXiv:2103.13651v3 (2021)"},{"key":"1419_CR18","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/s11075-019-00699-6","volume":"83","author":"N Krklec Jerinki\u0107","year":"2020","unstructured":"Krklec Jerinki\u0107, N., Ro\u017enjik, A.: Penalty variable sample size method for solving optimization problems with equality constraints in a form of mathematical expectation. Numer. Algoritm. 83, 701\u2013718 (2020). https:\/\/doi.org\/10.1007\/s11075-019-00699-6","journal-title":"Numer. Algoritm."},{"issue":"1","key":"1419_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/10556780290027828","volume":"17","author":"M M\u00e4kel\u00e4","year":"2002","unstructured":"M\u00e4kel\u00e4, M.: Survey of bundle methods for nonsmooth optimization. Optim. Methods Softw. 17(1), 1\u201329 (2002). https:\/\/doi.org\/10.1080\/10556780290027828","journal-title":"Optim. Methods Softw."},{"key":"1419_CR20","doi-asserted-by":"publisher","unstructured":"M\u00e4kel\u00e4, M., Neittaanmaki, P.: Nonsmooth Optimization: Analysis and Algorithms with Applications to Optimal Control. World Scientific Publishing Co. https:\/\/doi.org\/10.1142\/1493 (1992)","DOI":"10.1142\/1493"},{"key":"1419_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5563-6","volume-title":"Nonlinear Multiobjective Optimization","author":"K Miettinen","year":"1998","unstructured":"Miettinen, K.: Nonlinear Multiobjective Optimization. Springer, Berlin (1998). https:\/\/doi.org\/10.1007\/978-1-4615-5563-6"},{"key":"1419_CR22","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BFb0120960","volume":"17","author":"R Mifflin","year":"1982","unstructured":"Mifflin, R.: A modification and an extension of Lemarechal\u2019s algorithm for nonsmooth optimization. Math. Program. Stud. 17, 77\u201390 (1982). https:\/\/doi.org\/10.1007\/BFb0120960","journal-title":"Math. Program. Stud."},{"key":"1419_CR23","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1590\/0101-7438.2014.034.03.0647","volume":"34","author":"WD Oliveira","year":"2014","unstructured":"Oliveira, W.D., Sagastiz\u00e1bal, C.: Bundle methods in the XXIst century: A bird\u2019s-eye view. Pesqui. Operacional 34, 647\u2013670 (2014). https:\/\/doi.org\/10.1590\/0101-7438.2014.034.03.0647","journal-title":"Pesqui. Operacional"},{"issue":"1","key":"1419_CR24","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-010-0420-4","volume":"127","author":"S Shalev-Shwartz","year":"2011","unstructured":"Shalev-Shwartz, S., Singer, Y., Srebro, N., Cotter, A.: Pegasos: primal estimated sub-gradient solver for SVM. Math. Program. 127(1), 3\u201330 (2011). https:\/\/doi.org\/10.1007\/s10107-010-0420-4","journal-title":"Math. Program."},{"issue":"1","key":"1419_CR25","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/040603875","volume":"140","author":"C Sagastizabal","year":"2005","unstructured":"Sagastizabal, C., Solodov, M.: An infeasible bundle method for nonsmooth convex constrained optimization without penalty function or a filter. SIAM J. Optim. 140(1), 146\u2013169 (2005). https:\/\/doi.org\/10.1137\/040603875","journal-title":"SIAM J. Optim."},{"key":"1419_CR26","doi-asserted-by":"publisher","unstructured":"Shapiro, A., Dentcheva, D., Ruszczynski, A.: Lectures on stochastic programming: Modeling and theory, MPS-SIAM Series on Optimization. https:\/\/doi.org\/10.1137\/1.9780898718751 (2009)","DOI":"10.1137\/1.9780898718751"},{"key":"1419_CR27","doi-asserted-by":"publisher","unstructured":"Tan, C., Ma, S., Dai, Y.H., Qian, Y.: Barzilai-borwein step size for stochastic gradient descent. Ad. Neural Inf. Process. Syst 29. https:\/\/doi.org\/10.48550\/arXiv.1605.04131 (2016)","DOI":"10.48550\/arXiv.1605.04131"},{"key":"1419_CR28","first-page":"1145","volume":"11","author":"J Yu","year":"2010","unstructured":"Yu, J., Vishwanathan, S., Guenter, S., Schraudolph, N.: A quasi-newton approach to nonsmooth convex optimization problems in machine learning. J. Mach. Learn. Res. 11, 1145\u20131200 (2010)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-022-01419-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-022-01419-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-022-01419-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T10:24:43Z","timestamp":1680776683000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-022-01419-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,30]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1419"],"URL":"https:\/\/doi.org\/10.1007\/s11075-022-01419-3","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,30]]},"assertion":[{"value":"24 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of interest"}}]}}