{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T15:58:54Z","timestamp":1778255934337,"version":"3.51.4"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T00:00:00Z","timestamp":1707177600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T00:00:00Z","timestamp":1707177600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100008007","name":"Universit\u00e4t Paderborn","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100008007","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2024,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Approximation of subdifferentials is one of the main tasks when computing descent directions for nonsmooth optimization problems. In this article, we propose a bisection method for weakly lower semismooth functions which is able to compute new subgradients that improve a given approximation in case a direction with insufficient descent was computed. Combined with a recently proposed deterministic gradient sampling approach, this yields a deterministic and provably convergent way to approximate subdifferentials for computing descent directions.<\/jats:p>","DOI":"10.1007\/s10589-024-00552-0","type":"journal-article","created":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T13:02:37Z","timestamp":1707224557000},"page":"151-165","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A note on the convergence of deterministic gradient sampling in nonsmooth optimization"],"prefix":"10.1007","volume":"88","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4542-8620","authenticated-orcid":false,"given":"Bennet","family":"Gebken","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,6]]},"reference":[{"key":"552_CR1","doi-asserted-by":"publisher","unstructured":"Clarke, F.H.: Optimization and nonsmooth analysis. Soc. Ind. Appl. Math. (1990). https:\/\/doi.org\/10.1137\/1.9781611971309","DOI":"10.1137\/1.9781611971309"},{"issue":"1","key":"552_CR2","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/bf01584320","volume":"13","author":"AA Goldstein","year":"1977","unstructured":"Goldstein, A.A.: Optimization of lipschitz continuous functions. Math. Progr. 13(1), 14\u201322 (1977). https:\/\/doi.org\/10.1007\/bf01584320","journal-title":"Math. Progr."},{"issue":"3","key":"552_CR3","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1287\/moor.27.3.567.317","volume":"27","author":"JV Burke","year":"2002","unstructured":"Burke, J.V., Lewis, A.S., Overton, M.L.: Approximating subdifferentials by random sampling of gradients. Math. Operat. Res. 27(3), 567\u2013584 (2002). https:\/\/doi.org\/10.1287\/moor.27.3.567.317","journal-title":"Math. Operat. Res."},{"issue":"3","key":"552_CR4","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1137\/030601296","volume":"15","author":"JV Burke","year":"2005","unstructured":"Burke, J.V., Lewis, A.S., Overton, M.L.: A robust gradient sampling algorithm for nonsmooth, nonconvex optimization. SIAM J. Optimiz. 15(3), 751\u2013779 (2005). https:\/\/doi.org\/10.1137\/030601296","journal-title":"SIAM J. Optimiz."},{"key":"552_CR5","doi-asserted-by":"publisher","unstructured":"Burke, J.V., Curtis, F.E., Lewis, A.S., Overton, M.L., Sim\u00f5es, L.E.A.: Gradient sampling methods for nonsmooth optimization. In: Numerical Nonsmooth Optimization: State of the Art Algorithms, pp. 201\u2013225. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-34910-3_6","DOI":"10.1007\/978-3-030-34910-3_6"},{"issue":"1","key":"552_CR6","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/s10957-012-0024-7","volume":"155","author":"N Mahdavi-Amiri","year":"2012","unstructured":"Mahdavi-Amiri, N., Yousefpour, R.: An effective nonsmooth optimization algorithm for locally lipschitz functions. J. Optimizat. Theory Appl. 155(1), 180\u2013195 (2012). https:\/\/doi.org\/10.1007\/s10957-012-0024-7","journal-title":"J. Optimizat. Theory Appl."},{"key":"552_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10957-020-01803-w","volume":"80","author":"B Gebken","year":"2021","unstructured":"Gebken, B., Peitz, S.: An efficient descent method for locally lipschitz multiobjective optimization problems. J. Optimizat. Theory Appl. 80, 3\u201329 (2021). https:\/\/doi.org\/10.1007\/s10957-020-01803-w","journal-title":"J. Optimizat. Theory Appl."},{"key":"552_CR8","doi-asserted-by":"publisher","unstructured":"Gebken, B.: Computation and analysis of Pareto critical sets in smooth and nonsmooth multiobjective optimization. PhD Thesis, Paderborn University (2022) https:\/\/doi.org\/10.17619\/UNIPB\/1-1327","DOI":"10.17619\/UNIPB\/1-1327"},{"issue":"2","key":"552_CR9","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. Operat. Res. 2(2), 191\u2013207 (1977). https:\/\/doi.org\/10.1287\/moor.2.2.191","journal-title":"Math. Operat. Res."},{"key":"552_CR10","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. Progr. 141, 135\u2013163 (2013). https:\/\/doi.org\/10.1007\/s10107-012-0514-2","journal-title":"Math. Progr."},{"issue":"6","key":"552_CR11","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. SIAM J. Control Optimiz. 15(6), 959\u2013972 (1977). https:\/\/doi.org\/10.1137\/0315061","journal-title":"SIAM J. Control Optimiz."},{"issue":"2","key":"552_CR12","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1287\/moor.1070.0300","volume":"33","author":"D Sun","year":"2008","unstructured":"Sun, D., Sun, J.: L\u00f6wner\u2019s operator and spectral functions in euclidean jordan algebras. Math. Operat. Res. 33(2), 421\u2013445 (2008). https:\/\/doi.org\/10.1287\/moor.1070.0300","journal-title":"Math. Operat. Res."},{"issue":"6","key":"552_CR13","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1080\/10556788.2012.714781","volume":"28","author":"FE Curtis","year":"2013","unstructured":"Curtis, F.E., Que, X.: An adaptive gradient sampling algorithm for non-smooth optimization. Optimiz. Methods Softw. 28(6), 1302\u20131324 (2013). https:\/\/doi.org\/10.1080\/10556788.2012.714781","journal-title":"Optimiz. Methods Softw."},{"issue":"4","key":"552_CR14","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s12532-015-0086-2","volume":"7","author":"FE Curtis","year":"2015","unstructured":"Curtis, F.E., Que, X.: A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees. Math. Progr. Comput. 7(4), 399\u2013428 (2015). https:\/\/doi.org\/10.1007\/s12532-015-0086-2","journal-title":"Math. Progr. Comput."},{"issue":"1","key":"552_CR15","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10957-009-9584-6","volume":"144","author":"KC Kiwiel","year":"2009","unstructured":"Kiwiel, K.C.: Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization. J. Optimiz. Theory Appl 144(1), 69\u201375 (2009). https:\/\/doi.org\/10.1007\/s10957-009-9584-6","journal-title":"J. Optimiz. Theory Appl"},{"key":"552_CR16","doi-asserted-by":"publisher","unstructured":"Lemar\u00e9chal, C.: Chapter VII. Nondifferentiable optimization. In: Handbooks in Operations Research and Management Science, pp. 529\u2013572. Elsevier, Amsterdam (1989). https:\/\/doi.org\/10.1016\/s0927-0507(89)01008-x","DOI":"10.1016\/s0927-0507(89)01008-x"},{"issue":"3","key":"552_CR17","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1090\/s0002-9939-1959-0105008-8","volume":"10","author":"W Cheney","year":"1959","unstructured":"Cheney, W., Goldstein, A.A.: Proximity maps for convex sets. Proc. Am. Math. Soc. 10(3), 448\u2013448 (1959). https:\/\/doi.org\/10.1090\/s0002-9939-1959-0105008-8","journal-title":"Proc. Am. Math. Soc."},{"issue":"4","key":"552_CR18","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1007\/s11228-021-00610-3","volume":"29","author":"JV Burke","year":"2021","unstructured":"Burke, J.V., Lin, Q.: Convergence of the gradient sampling algorithm on directionally lipschitz functions. Set-Valued Var. Anal. 29(4), 949\u2013966 (2021). https:\/\/doi.org\/10.1007\/s11228-021-00610-3","journal-title":"Set-Valued Var. Anal."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00552-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-024-00552-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00552-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T10:45:34Z","timestamp":1714128334000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-024-00552-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,6]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["552"],"URL":"https:\/\/doi.org\/10.1007\/s10589-024-00552-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,6]]},"assertion":[{"value":"5 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2024","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 author has no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}