{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T09:26:31Z","timestamp":1761989191385,"version":"3.37.3"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,3,30]],"date-time":"2018-03-30T00:00:00Z","timestamp":1522368000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Guangxi Science Fund for Distinguished Young Scholars","award":["2015GXNSFGA139001"],"award-info":[{"award-number":["2015GXNSFGA139001"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11261006","11661009"],"award-info":[{"award-number":["11261006","11661009"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s10589-018-9999-9","type":"journal-article","created":{"date-parts":[[2018,3,30]],"date-time":"2018-03-30T02:47:20Z","timestamp":1522378040000},"page":"251-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["An effective adaptive trust region algorithm for nonsmooth minimization"],"prefix":"10.1007","volume":"71","author":[{"given":"Zhou","family":"Sheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gonglin","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,30]]},"reference":[{"key":"9999_CR1","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 Publishing, Singapore (1992)"},{"key":"9999_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08114-4","volume-title":"Introduction to Nonsmooth Optimization: Theory, Practice and Software","author":"A Bagirov","year":"2014","unstructured":"Bagirov, A., Karmitsa, N., M\u00e4kel\u00e4, M.M.: Introduction to Nonsmooth Optimization: Theory, Practice and Software. Springer, Berlin (2014)"},{"key":"9999_CR3","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1109\/TIFS.2014.2381872","volume":"10","author":"J Li","year":"2015","unstructured":"Li, J., Li, X., Yang, B., Sun, X.: Segmentation-based image copy-move forgery detection scheme. IEEE Trans. Inf. Forensics Secur. 10, 507\u2013518 (2015)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"9999_CR4","first-page":"373","volume":"83","author":"L Luks\u0306an","year":"1998","unstructured":"Luks\u0306an, L., Vlc\u0306ek, J.: A bundle-Newton method for nonsmooth unconstrained minimization. Math. Program. 83, 373\u2013391 (1998)","journal-title":"Math. Program."},{"key":"9999_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/10556780290027828","volume":"17","author":"MM M\u00e4kel\u00e4","year":"2002","unstructured":"M\u00e4kel\u00e4, M.M.: Survey of bundle methods for nonsmooth optimization. Optim. Methods Softw. 17, 1\u201329 (2002)","journal-title":"Optim. Methods Softw."},{"key":"9999_CR6","volume-title":"Minimization Methods for Non-differentiable Functions","author":"NZ Shor","year":"2012","unstructured":"Shor, N.Z.: Minimization Methods for Non-differentiable Functions. Springer, Berlin (2012)"},{"key":"9999_CR7","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-max-min problems using adaptive smoothing techniques. J. Optim. Theory Appl. 119, 421\u2013457 (2003)","journal-title":"J. Optim. Theory Appl."},{"key":"9999_CR8","first-page":"1","volume":"32","author":"GN Grapiglia","year":"2014","unstructured":"Grapiglia, G.N., Yuan, J., Yuan, Y.: A derivative-free trust-region algorithm for composite nonsmooth optimization. Comput. Appl. Math. 32, 1\u201325 (2014)","journal-title":"Comput. Appl. Math."},{"key":"9999_CR9","doi-asserted-by":"publisher","first-page":"1106","DOI":"10.1137\/S1052623494278839","volume":"6","author":"M Fukushima","year":"1996","unstructured":"Fukushima, M., Qi, L.: A globally and superlinearly convergent algorithm for nonsmooth convex minimization. SIAM J. Optim. 6, 1106\u20131120 (1996)","journal-title":"SIAM J. Optim."},{"key":"9999_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.3934\/jimo.2005.1.171","volume":"1","author":"N Sagara","year":"2005","unstructured":"Sagara, N., Fukushima, M.: A trust region method for nonsmooth convex optimization. J. Ind. Manag. Optim. 1, 171\u2013180 (2005)","journal-title":"J. Ind. Manag. Optim."},{"key":"9999_CR11","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.amc.2007.03.059","volume":"193","author":"L Zhang","year":"2007","unstructured":"Zhang, L.: A new trust region algorithm for nonsmooth convex minimization. Appl. Math. Comput. 193, 135\u2013142 (2007)","journal-title":"Appl. Math. Comput."},{"key":"9999_CR12","doi-asserted-by":"publisher","first-page":"203","DOI":"10.3846\/13926292.2012.661375","volume":"17","author":"G Yuan","year":"2012","unstructured":"Yuan, G., Wei, Z.: The Barzilai and Borwein gradient method with nonmonotone line search for nonsmooth convex optimization problems. Math. Model. Anal. 17, 203\u2013216 (2012)","journal-title":"Math. Model. Anal."},{"key":"9999_CR13","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s10589-012-9485-8","volume":"54","author":"G Yuan","year":"2013","unstructured":"Yuan, G., Wei, Z., Wang, Z.: Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization. Comput. Optim. Appl. 54, 45\u201364 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"9999_CR14","first-page":"1","volume":"10","author":"Z Cui","year":"2015","unstructured":"Cui, Z., Yuan, G., Sheng, Z., Liu, W., Wang, X., Duan, X.: A modified BFGS formula using a trust region model for nonsmooth convex minimizations. PLoS ONE 10, 1\u201315 (2015)","journal-title":"PLoS ONE"},{"key":"9999_CR15","first-page":"1","volume":"52","author":"Y Ou","year":"2015","unstructured":"Ou, Y., Lin, H.: An ODE-like nonmonotone method for nonsmooth convex optimization. J. Appl. Math. Comput. 52, 1\u201321 (2015)","journal-title":"J. Appl. Math. Comput."},{"key":"9999_CR16","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10957-015-0781-1","volume":"168","author":"G Yuan","year":"2016","unstructured":"Yuan, G., Meng, Z., Li, Y.: A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations. J. Optim. Theory Appl. 168, 129\u2013152 (2016)","journal-title":"J. Optim. Theory Appl."},{"key":"9999_CR17","first-page":"1","volume":"11","author":"G Yuan","year":"2016","unstructured":"Yuan, G., Sheng, Z., Liu, W.: The modified HZ conjugate gradient algorithm for large-scale nonsmooth optimization. PLoS ONE 11, 1\u201315 (2016)","journal-title":"PLoS ONE"},{"key":"9999_CR18","volume-title":"Nonsmooth Optimization Algorithms","author":"G Yuan","year":"2017","unstructured":"Yuan, G., Sheng, Z.: Nonsmooth Optimization Algorithms. Press of Science, Beijing (2017)"},{"key":"9999_CR19","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":"9999_CR20","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/s10957-014-0534-6","volume":"164","author":"Z Akbari","year":"2015","unstructured":"Akbari, Z., Yousefpour, R., Peyghami, M.R.: A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems. J. Optim. Theory Appl. 164, 733\u2013754 (2015)","journal-title":"J. Optim. Theory Appl."},{"key":"9999_CR21","doi-asserted-by":"crossref","unstructured":"Powell, M.J.D.: A new algorithm for unconstrained optimization. In: Rosen, J.B., Mangasarian, O.L., Ritter, K. (eds.) Nonlinear Programming, pp. 31\u201365. Academic Press (1970).","DOI":"10.1016\/B978-0-12-597050-1.50006-3"},{"key":"9999_CR22","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1360\/02ys9067","volume":"45","author":"X Zhang","year":"2002","unstructured":"Zhang, X., Zhang, J., Liao, L.: An adaptive trust region method and its convergence. Sci. China Ser. A Math. 45, 620\u2013631 (2002)","journal-title":"Sci. China Ser. A Math."},{"key":"9999_CR23","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s10589-012-9460-4","volume":"53","author":"Z Cui","year":"2012","unstructured":"Cui, Z., Wu, B.: A new modified nonmonotone adaptive trust region method for unconstrained optimization. Comput. Optim. Appl. 53, 795\u2013806 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"9999_CR24","first-page":"843","volume":"23","author":"G Li","year":"2006","unstructured":"Li, G.: A trust region method with automatic determination of the trust region radius. Chin. J. Eng. Math. 23, 843\u2013848 (2006)","journal-title":"Chin. J. Eng. Math."},{"key":"9999_CR25","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.cam.2007.01.027","volume":"213","author":"ZJ Shi","year":"2008","unstructured":"Shi, Z.J., Guo, J.H.: A new trust region method for unconstrained optimization. J. Comput. Appl. Math. 213, 509\u2013520 (2008)","journal-title":"J. Comput. Appl. Math."},{"key":"9999_CR26","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.ejor.2010.09.007","volume":"208","author":"Z Shi","year":"2011","unstructured":"Shi, Z., Wang, S.: Nonmonotone adaptive trust region method. Eur. J. Oper. Res. 208, 28\u201336 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"9999_CR27","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1080\/10556788.2010.526607","volume":"27","author":"Z Cui","year":"2012","unstructured":"Cui, Z., Wu, B.: A new trust region method with adaptive radius for unconstrained optimization. Optim. Methods Softw. 27, 419\u2013429 (2012)","journal-title":"Optim. Methods Softw."},{"key":"9999_CR28","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."},{"key":"9999_CR29","first-page":"1","volume":"11","author":"A Kamandi","year":"2016","unstructured":"Kamandi, A., Amini, K., Ahookhosh, M.: An improved adaptive trust-region algorithm. Optim. Lett. 11, 1\u201315 (2016)","journal-title":"Optim. Lett."},{"key":"9999_CR30","doi-asserted-by":"publisher","first-page":"3003","DOI":"10.1016\/j.apm.2013.11.023","volume":"38","author":"H Esmaeili","year":"2014","unstructured":"Esmaeili, H., Kimiaei, M.: A new adaptive trust-region method for system of nonlinear equations. Appl. Math. Model. 38, 3003\u20133015 (2014)","journal-title":"Appl. Math. Model."},{"key":"9999_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11075-016-0126-7","volume":"73","author":"M Kimiaei","year":"2016","unstructured":"Kimiaei, M., Esmaeili, H.: A trust-region approach with novel filter adaptive radius for system of nonlinear equations. Numer. Algoritm. 73, 1\u201318 (2016)","journal-title":"Numer. Algoritm."},{"key":"9999_CR32","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF01581275","volume":"58","author":"L Qi","year":"1993","unstructured":"Qi, L., Sun, J.: A nonsmooth version of Newton\u2019s method. Math. Program. 58, 353\u2013367 (1993)","journal-title":"Math. Program."},{"key":"9999_CR33","volume-title":"Optimization and Nonsmooth Analysis","author":"FH Clarke","year":"1983","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. SIAM, Bangkok (1983)"},{"key":"9999_CR34","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/BF02193060","volume":"85","author":"JS Pang","year":"1995","unstructured":"Pang, J.S., Qi, L.: A globally convergent Newton method for convex $$SC^1$$ S C 1 minimization problems. J. Optim. Theory Appl. 85, 633\u2013648 (1995)","journal-title":"J. Optim. Theory Appl."},{"key":"9999_CR35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-06409-2","volume-title":"Convex Analysis and Minimization Algorithms II: Advanced Theory and Bundle Methods, vol. 306 of Grundlehren der Mathematischen Wissenschaften","author":"JB Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms II: Advanced Theory and Bundle Methods, vol. 306 of Grundlehren der Mathematischen Wissenschaften. Springer, Berlin (1993)"},{"key":"9999_CR36","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1287\/moor.18.1.227","volume":"18","author":"L Qi","year":"1993","unstructured":"Qi, L.: Convergence analysis of some algorithms for solving nonsmooth equations. Math. Oper. Res. 18, 227\u2013244 (1993)","journal-title":"Math. Oper. Res."},{"key":"9999_CR37","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF02591883","volume":"30","author":"M Fukushima","year":"1984","unstructured":"Fukushima, M.: A descent algorithm for nonsmooth convex optimization. Math. Program. 30, 163\u2013175 (1984)","journal-title":"Math. Program."},{"key":"9999_CR38","first-page":"102","volume-title":"Numerical Methods for Nondifferentiable Convex Optimization. Nonlinear Analysis and Optimization","author":"A Auslender","year":"1987","unstructured":"Auslender, A.: Numerical Methods for Nondifferentiable Convex Optimization. Nonlinear Analysis and Optimization, pp. 102\u2013126. Springer, Berlin (1987)"},{"key":"9999_CR39","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":"9999_CR40","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1023\/A:1004633524446","volume":"104","author":"AI Rauf","year":"2000","unstructured":"Rauf, A.I., Fukushima, M.: Globally convergent BFGS method for nonsmooth convex optimization. J. Optim. Theory Appl. 104, 539\u2013558 (2000)","journal-title":"J. Optim. Theory Appl."},{"key":"9999_CR41","doi-asserted-by":"crossref","first-page":"1156","DOI":"10.1016\/j.amc.2005.08.027","volume":"175","author":"Z Wei","year":"2006","unstructured":"Wei, Z., Li, G., Qi, L.: New quasi-Newton methods for unconstrained optimization problems. Appl. Math. Comput. 175, 1156\u20131188 (2006)","journal-title":"Appl. Math. Comput."},{"key":"9999_CR42","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.cam.2013.04.032","volume":"255","author":"G Yuan","year":"2014","unstructured":"Yuan, G., Wei, Z., Li, G.: A modified Polak\u2013Ribi\u00e8re\u2013Polyak conjugate gradient algorithm for nonsmooth convex programs. J. Comput. Appl. Math. 255, 86\u201396 (2014)","journal-title":"J. Comput. Appl. Math."},{"key":"9999_CR43","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s00607-011-0146-z","volume":"92","author":"G Yuan","year":"2011","unstructured":"Yuan, G., Wei, Z., Lu, X.: A BFGS trust-region method for nonlinear equations. Computing 92, 317\u2013333 (2011)","journal-title":"Computing"},{"key":"9999_CR44","first-page":"1","volume":"2","author":"MJD Powell","year":"1975","unstructured":"Powell, M.J.D.: Convergence properties of a class of minimization algorithms. Nonlinear Program. 2, 1\u201327 (1975)","journal-title":"Nonlinear Program."},{"key":"9999_CR45","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857","volume-title":"Trust Region Methods","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust Region Methods. SIAM, Bangkok (2000)"},{"key":"9999_CR46","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1137\/0720042","volume":"20","author":"T Steihaug","year":"1983","unstructured":"Steihaug, T.: The conjugate gradient method and trust regions in large scale optimization. SIAM J. Numer. Anal. 20, 626\u2013637 (1983)","journal-title":"SIAM J. Numer. Anal."},{"key":"9999_CR47","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF01580609","volume":"60","author":"G Pillo Di","year":"1993","unstructured":"Di Pillo, G., Grippo, L., Lucidi, S.: A smooth method for the finite minimax problem. Math. Program. 60, 187\u2013214 (1993)","journal-title":"Math. Program."},{"key":"9999_CR48","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1080\/10556780290027837","volume":"17","author":"A Bagirov","year":"2002","unstructured":"Bagirov, A.: A method for minimization of quasidifferentiable functions. Optim. Methods Softw. 17, 31\u201360 (2002)","journal-title":"Optim. Methods Softw."},{"key":"9999_CR49","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."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-018-9999-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-9999-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-9999-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T12:43:58Z","timestamp":1719924238000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-018-9999-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,30]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["9999"],"URL":"https:\/\/doi.org\/10.1007\/s10589-018-9999-9","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2018,3,30]]},"assertion":[{"value":"26 December 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}