{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,24]],"date-time":"2026-09-24T09:09:48Z","timestamp":1790240988876,"version":"4.1.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T00:00:00Z","timestamp":1763596800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T00:00:00Z","timestamp":1763596800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62371094"],"award-info":[{"award-number":["62371094"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1007\/s11075-025-02269-5","type":"journal-article","created":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T01:22:02Z","timestamp":1763601722000},"page":"1415-1433","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An adaptive nonmonotone line search technique for nonsmooth optimization"],"prefix":"10.1007","volume":"103","author":[{"given":"Mei","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaojun","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,11,20]]},"reference":[{"key":"2269_CR1","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. SpringerVerlag, Berlin (1985)"},{"issue":"3","key":"2269_CR2","first-page":"563","volume":"102","author":"AA Kumari","year":"2015","unstructured":"Kumari, A.A.: Subgradient Methods for nonsmooth vector optimization problems. International Journal of Pure and Applied Mathematics 102(3), 563\u2013578 (2015)","journal-title":"International Journal of Pure and Applied Mathematics"},{"key":"2269_CR3","volume-title":"Batch-Stochastic Sub-Gradient Method for Solving nonsmooth Convex Loss Function Problems","author":"KJ Ahmed","year":"2023","unstructured":"Ahmed, K.J.: Batch-Stochastic Sub-Gradient Method for Solving nonsmooth Convex Loss Function Problems. Int. J. Mob. Netw. Commun, Telem (2023)"},{"key":"2269_CR4","unstructured":"Bagirov, A.M., Nazari Ganjehlou, A., Tor, H., Ugon, J.: A generalized subgradient method with piecewise linear subproblem, Dynamics of Continuous. Discrete and Impulsive Systems Series B: Applications and Algorithms. 17(B): 621-638 (2010)"},{"issue":"2","key":"2269_CR5","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1137\/120864192","volume":"23","author":"J Yang","year":"2013","unstructured":"Yang, J., Sun, D., Toh, K.C.: A proximal point algorithm for logdeterminant optimization with group Lasso regularization. SIAM J. Optim. 23(2), 857\u2013893 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2269_CR6","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146(1), 459\u2013494 (2014)","journal-title":"Math. Program."},{"issue":"6","key":"2269_CR7","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1080\/10556780410001689225","volume":"19","author":"M Haarala","year":"2004","unstructured":"Haarala, M., Miettinen, K., M\u00e4kel\u00e4, M.M.: New limited memory bundle method for largescale nonsmooth optimization. Optimization Methods and Software 19(6), 673\u2013692 (2004)","journal-title":"Optimization Methods and Software"},{"issue":"3","key":"2269_CR8","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1023\/B:JOTA.0000006684.67437.c3","volume":"119","author":"E Polak","year":"2003","unstructured":"Polak, E., Royset, J.O.: Algorithms for finite and semi-infinite min Cmax Cmin problems using adaptive smoothing techniques. J. Optim. Theory Appl. 119(3), 421\u2013457 (2003)","journal-title":"J. Optim. Theory Appl."},{"key":"2269_CR9","first-page":"201","volume-title":"Gradient sampling methods for nonsmooth optimization","author":"JV Burke","year":"2020","unstructured":"Burke, J.V., Curtis, F.E., Lewis, A.S., et al.: Gradient sampling methods for nonsmooth optimization, pp. 201\u2013225. State of the art algorithms, Numerical nonsmooth optimization (2020)"},{"key":"2269_CR10","doi-asserted-by":"publisher","first-page":"6692","DOI":"10.52202\/068431-0485","volume":"35","author":"D Davis","year":"2022","unstructured":"Davis, D., Drusvyatskiy, D., Lee, Y.T., et al.: A gradient sampling method with complexity guarantees for Lipschitz functions in high and low dimensions. Adv. Neural. Inf. Process. Syst. 35, 6692\u20136703 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"2269_CR11","doi-asserted-by":"publisher","first-page":"571","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. Optim. 15, 571\u2013779 (2005)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2269_CR12","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(2), 379\u2013388 (2007)","journal-title":"SIAM J. Optim."},{"key":"2269_CR13","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. Mathmatical Programming 66, 25\u201343 (1994)","journal-title":"Mathmatical Programming"},{"issue":"3","key":"2269_CR14","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1023\/B:JOTA.0000006684.67437.c3","volume":"119","author":"Z Akbari","year":"2013","unstructured":"Akbari, Z., Yousefpour, R., Reza Peyghami, M.: A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems. J. Optim. Theory Appl. 119(3), 421\u2013457 (2013)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"2269_CR15","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s10107-023-01941-9","volume":"202","author":"S Sun","year":"2023","unstructured":"Sun, S., Nocedal, J.: A trust region method for noisy unconstrained optimization. Math. Program. 202(1), 445\u2013472 (2023)","journal-title":"Math. Program."},{"issue":"1","key":"2269_CR16","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1014075113874","volume":"23","author":"VF Demyanov","year":"2002","unstructured":"Demyanov, V.F., Bagirov, A.M., Rubinov, A.M.: A method of truncated codifferential with application to some problems of cluster analysis. J. Global Optim. 23(1), 63\u201380 (2002)","journal-title":"J. Global Optim."},{"issue":"3","key":"2269_CR17","first-page":"483","volume":"6","author":"AM Bagirov","year":"2010","unstructured":"Bagirov, A.M., Ganjehlou, A., Ugon, J., Tor, A.: Truncated codifferential method for nonsmooth convex optimization. Pacific Journal of Optimization 6(3), 483\u2013496 (2010)","journal-title":"Pacific Journal of Optimization"},{"issue":"1","key":"2269_CR18","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10898-010-9569-x","volume":"50","author":"AM Bagirov","year":"2011","unstructured":"Bagirov, A.M., Ugon, J.: Codifferential method for minimizing nonsmooth DC functions. J. Global Optim. 50(1), 3\u201322 (2011)","journal-title":"J. Global Optim."},{"key":"2269_CR19","doi-asserted-by":"crossref","unstructured":"Tor, A.H., Bagirov, A.M., Karaszen, B.: Aggregate codifferential method for nonsmooth DC optimization. Journal of computational and applied mathematics 259(B), 851-867 (2014)","DOI":"10.1016\/j.cam.2013.08.010"},{"issue":"3","key":"2269_CR20","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1007\/s10589-018-0024-0","volume":"71","author":"MV Dolgopolik","year":"2018","unstructured":"Dolgopolik, M.V.: A convergence analysis of the method of codifferential descent. Comput. Optim. Appl. 71(3), 879\u2013913 (2018)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"2269_CR21","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10957-007-9335-5","volume":"137","author":"AM Bagirov","year":"2008","unstructured":"Bagirov, A.M., Karaszen, B., Sezer, M.: Discrete gradient method: derivative-free method for nonsmooth optimization. J. Optim. Theory Appl. 137(2), 317\u2013334 (2008)","journal-title":"J. Optim. Theory Appl."},{"key":"2269_CR22","volume-title":"A brief history of filter methods, Technical Report, ANL\/MCS-P1372-0906","author":"R Fletcher","year":"2006","unstructured":"Fletcher, R., Leyffer, S., Toint, P.: A brief history of filter methods, Technical Report, ANL\/MCS-P1372-0906. Argonne National Laboratory, Mathematics and Computer Science Division (2006)"},{"issue":"2","key":"2269_CR23","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1023\/A:1013653923062","volume":"112","author":"YH Dai","year":"2002","unstructured":"Dai, Y.H.: On the nonmonotone line search. J. Optim. Theory Appl. 112(2), 315\u2013330 (2002)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"2269_CR24","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1137\/S106482759427021X","volume":"17","author":"PL Toint","year":"1996","unstructured":"Toint, P.L.: An assessment of nonmonotone linesearch techniques for unconstrained optimization. SIAM J. Sci. Comput. 17(3), 725\u2013739 (1996)","journal-title":"SIAM J. Sci. Comput."},{"key":"2269_CR25","volume-title":"Optimization theory and methods: nonlinear programming","author":"W Sun","year":"2006","unstructured":"Sun, W., Yuan, Y.X.: Optimization theory and methods: nonlinear programming. Springer, New York (2006)"},{"key":"2269_CR26","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF00940345","volume":"60","author":"L Grippo","year":"1989","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A truncated Newton method with nonmonotone line search for unconstrained optimization. J. Optim. Theory Appl. 60, 401\u2013419 (1989)","journal-title":"J. Optim. Theory Appl."},{"key":"2269_CR27","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1137\/S1052623494266365","volume":"7","author":"M Raydan","year":"1997","unstructured":"Raydan, M.: The Barzilai and Borwein gradient method for the large scale unconstrained minimization problem. SIAM J. Optim. 7, 26\u201333 (1997)","journal-title":"SIAM J. Optim."},{"key":"2269_CR28","first-page":"387","volume":"33","author":"Z Wan","year":"2011","unstructured":"Wan, Z., Feng, D.: Investigation on a class of nonmonotone cautious BFGS algorithms. Math. Numer. Sin. 33, 387\u2013396 (2011)","journal-title":"Math. Numer. Sin."},{"key":"2269_CR29","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1137\/S1052623403428208","volume":"14","author":"H Zhang","year":"2004","unstructured":"Zhang, H., Hager, W.W.: A nonmonotone line search technique and its application to unconstrained optimization. SIAM J. Optim. 14, 1043\u20131056 (2004)","journal-title":"SIAM J. Optim."},{"key":"2269_CR30","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.apnum.2014.12.009","volume":"91","author":"Q Zhou","year":"2015","unstructured":"Zhou, Q., Hang, D.: Nonmonotone adaptive trust region method with line search based on new diagonal updating. Appl. Numer. Math. 91, 75\u201388 (2015)","journal-title":"Appl. Numer. Math."},{"issue":"1","key":"2269_CR31","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s12190-015-0912-8","volume":"51","author":"G Yuan","year":"2016","unstructured":"Yuan, G., Wei, Z.: A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problem. J. Appl. Math. Comput. 51(1), 397\u2013412 (2016)","journal-title":"J. Appl. Math. Comput."},{"key":"2269_CR32","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.cam.2016.09.014","volume":"313","author":"S Huang","year":"2017","unstructured":"Huang, S., Wan, Z.: A new nonmonotone spectral residual method for nonsmooth nonlinear equations. J. Comput. Appl. Math. 313, 82\u2013101 (2017)","journal-title":"J. Comput. Appl. Math."},{"key":"2269_CR33","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1007\/s10898-024-01366-4","volume":"89","author":"H Liu","year":"2024","unstructured":"Liu, H., Wang, T., Liu, Z.: A nonmonotone accelerated proximal gradient method with variable stepsize strategy for nonsmooth and nonconvex minimization problems. J. Global Optim. 89, 863\u2013897 (2024)","journal-title":"J. Global Optim."},{"issue":"2","key":"2269_CR34","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1080\/02331934.2022.2108709","volume":"73","author":"Z Akbari","year":"2024","unstructured":"Akbari, Z.: A new nonmonotone line search method for nonsmooth nonconvex optimization. Optimization 73(2), 429\u2013441 (2024)","journal-title":"Optimization"},{"key":"2269_CR35","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. Optim. Theory Appl. 155, 180\u2013195 (2012)","journal-title":"J. Optim. Theory Appl."},{"key":"2269_CR36","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 Publishing Company, New York (2014)"},{"key":"2269_CR37","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF01584320","volume":"13","author":"A Goldstein","year":"1977","unstructured":"Goldstein, A.: Optimization of Lipschitz continuous functions. Mathmatical Programming 13, 14\u201322 (1977)","journal-title":"Mathmatical Programming"},{"key":"2269_CR38","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)"},{"issue":"4","key":"2269_CR39","first-page":"707","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A nonmonotone line search technique for Newton\u2019s method. SIAM Journal on Numerical 23(4), 707\u2013716 (1986)","journal-title":"SIAM Journal on Numerical"},{"key":"2269_CR40","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First-order methods in optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-order methods in optimization. Society for Industrial and Applied Mathematics, Philadelphia (2017)"},{"key":"2269_CR41","unstructured":"Grothey, A.: Decomposition Methods for Nonlinear Nonconvex Optimization Problems. PhD thesis, University of Edinburgh (2001)"},{"key":"2269_CR42","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, vol. 1133. Springer-Verlag, Berlin (1985)"},{"key":"2269_CR43","unstructured":"Schramm, H.: Eine Kombination von Bundleund Trust-Region-Verfahren zur L\u00f6sung nichtdifferenzierbarer Optimierungsprobleme, PhD thesis, Bayreuther Mathematische Schriften, No. 30, Universit\u00e4t Bayreuth (1989)"},{"issue":"4","key":"2269_CR44","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1137\/0327039","volume":"27","author":"KC Kiwiel","year":"1989","unstructured":"Kiwiel, K.C.: An ellipsoid trust region bundle method for nonsmooth convex optimization. SIAM J. Control. Optim. 27(4), 737\u2013757 (1989)","journal-title":"SIAM J. Control. Optim."},{"key":"2269_CR45","unstructured":"Womersley, R.S.: Numerical Methods for Structured Problems in Non-smooth Optimization, PhD thesis, Department of Mathematics, University of Dundee (1981)"},{"issue":"1","key":"2269_CR46","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1137\/0715011","volume":"15","author":"C Charalambous","year":"1978","unstructured":"Charalambous, C., Conn, A.R.: An efficient method to solve the minimax problem directly. SIAM J. Numer. Anal. 15(1), 162\u2013187 (1978)","journal-title":"SIAM J. Numer. Anal."},{"issue":"182","key":"2269_CR47","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1090\/S0025-5718-1988-0929544-3","volume":"50","author":"AR Conn","year":"1988","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Testing a class of methods for solving minimization problems with simple bounds on the variables. Math. Comput. 50(182), 399\u2013430 (1988)","journal-title":"Math. Comput."},{"key":"2269_CR48","unstructured":"Gupta, N.: A Higher than First Order Algorithm for Nonsmooth Constrained Optimization, PhD thesis, Washington State University (1985)"},{"issue":"3","key":"2269_CR49","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0167-6377(02)00231-6","volume":"31","author":"A Beck","year":"2003","unstructured":"Beck, A., Teboulle, M.: Mirror descent and nonlinear projected subgradient methods for convex optimization. Oper. Res. Lett. 31(3), 167\u2013175 (2003)","journal-title":"Oper. Res. Lett."},{"issue":"11","key":"2269_CR50","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1002\/cpa.20042","volume":"57","author":"I Daubechies","year":"2004","unstructured":"Daubechies, I., Defrise, M., Mol, C.D.: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Commun. Pure Appl. Math. 57(11), 1413\u20131457 (2004)","journal-title":"Commun. Pure Appl. Math."},{"issue":"1","key":"2269_CR51","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imag. Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imag. Sci."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02269-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-025-02269-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02269-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,9,24]],"date-time":"2026-09-24T08:42:17Z","timestamp":1790239337000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-025-02269-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,20]]},"references-count":51,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,10]]}},"alternative-id":["2269"],"URL":"https:\/\/doi.org\/10.1007\/s11075-025-02269-5","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,20]]},"assertion":[{"value":"5 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no conflict of interest.","order":1,"name":"Ethics","label":"Conflict of Interest","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","label":"Competing interests","group":{"name":"EthicsHeading","label":"Declarations"}}]}}