{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T18:40:57Z","timestamp":1761676857822},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2020,2,21]],"date-time":"2020-02-21T00:00:00Z","timestamp":1582243200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,21]],"date-time":"2020-02-21T00:00:00Z","timestamp":1582243200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s11590-020-01558-3","type":"journal-article","created":{"date-parts":[[2020,2,21]],"date-time":"2020-02-21T17:03:02Z","timestamp":1582304582000},"page":"2355-2377","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A hybrid method for solving systems of nonsmooth equations with box constraints"],"prefix":"10.1007","volume":"14","author":[{"given":"Yigui","family":"Ou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haichan","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,21]]},"reference":[{"key":"1558_CR1","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1137\/0803021","volume":"3","author":"JS Pang","year":"1993","unstructured":"Pang, J.S., Qi, L.Q.: Nonsmooth equations: motivation and algorithms. SIAM J. Optim. 3, 443\u2013465 (1993)","journal-title":"SIAM J. Optim."},{"key":"1558_CR2","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (2006)"},{"key":"1558_CR3","volume-title":"Iterative Solution of Nonlinear Equations in Several Variables","author":"JM Ortega","year":"1970","unstructured":"Ortega, J.M., Rheinboldt, W.C.: Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York (1970)"},{"key":"1558_CR4","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF01581275","volume":"58","author":"LQ Qi","year":"1993","unstructured":"Qi, L.Q.: A nonsmooth version of Newton\u2019s methods. Math. Prog. 58, 353\u2013368 (1993)","journal-title":"Math. Prog."},{"key":"1558_CR5","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1080\/02331934.2011.603321","volume":"62","author":"LQ Qi","year":"2013","unstructured":"Qi, L.Q., Wei, Z.X., Yuan, G.L.: An active-set projected trust region algorithm with limited memory BFGS technique for box constrained nonsmooth equations. Optimization 62, 857\u2013878 (2013)","journal-title":"Optimization"},{"key":"1558_CR6","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/BF02832062","volume":"22","author":"YG Ou","year":"2006","unstructured":"Ou, Y.G.: A superlinearly convergent ODE-type trust region algorithm for nonsmooth nonlinear equations. J. Appl. Math. Comput. 22, 371\u2013380 (2006)","journal-title":"J. Appl. Math. Comput."},{"key":"1558_CR7","first-page":"107","volume":"229","author":"C Ling","year":"2014","unstructured":"Ling, C., Wang, G.F., He, H.J.: A new Levenberg\u2013Marquardt type algorithm for solving nonsmooth constrained equations. Appl. Math. Comput. 229, 107\u2013122 (2014)","journal-title":"Appl. Math. Comput."},{"key":"1558_CR8","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1109\/TNNLS.2013.2278427","volume":"25","author":"W Bian","year":"2014","unstructured":"Bian, W., Chen, X.J.: Neural network for nonsmooth, nonconvex constrained minimization via smooth approximation. IEEE Trans. Neural Netw. Learn. Syst. 25, 545\u2013556 (2014)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"1558_CR9","doi-asserted-by":"crossref","first-page":"707","DOI":"10.3934\/jimo.2017070","volume":"14","author":"S Zhou","year":"2018","unstructured":"Zhou, S., Yuan, G.L., Cui, Z., Duan, X.B., Wang, X.L.: An adaptive trust region algorithm for large-residual nonsmooth least squares problems. J. Ind. Manag. Optim. 14, 707\u2013718 (2018)","journal-title":"J. Ind. Manag. Optim."},{"key":"1558_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-012-0569-0","volume":"134","author":"XJ Chen","year":"2012","unstructured":"Chen, X.J.: Smoothing methods for nonsmooth, nonconvex minimization. Math. Prog. 134, 71\u201399 (2012)","journal-title":"Math. Prog."},{"key":"1558_CR11","first-page":"9855","volume":"217","author":"L Yang","year":"2011","unstructured":"Yang, L., Chen, Y.P., Tong, X.J., Deng, C.L.: A new smoothing Newton method for solving constrained nonlinear equations. Appl. Math. Comput. 217, 9855\u20139863 (2011)","journal-title":"Appl. Math. Comput."},{"key":"1558_CR12","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo, L., Lamparillo, F., Lucidi, S.: A nonmonotone line search technique for Newton\u2019s method. SIAM J. Numer. Anal. 23, 707\u2013716 (1986)","journal-title":"SIAM J. Numer. Anal."},{"key":"1558_CR13","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1137\/S1052623403428208","volume":"14","author":"HC Zhang","year":"2004","unstructured":"Zhang, H.C., 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":"1558_CR14","doi-asserted-by":"publisher","first-page":"2158","DOI":"10.1016\/j.camwa.2007.08.038","volume":"55","author":"NZ Gu","year":"2008","unstructured":"Gu, N.Z., Mo, J.T.: Incorporating nonmonotone strategies into the trust region method for unconstrained optimization. Comput. Math. Appl. 55, 2158\u20132172 (2008)","journal-title":"Comput. Math. Appl."},{"key":"1558_CR15","doi-asserted-by":"crossref","first-page":"785","DOI":"10.3934\/jimo.2017075","volume":"14","author":"YG Ou","year":"2018","unstructured":"Ou, Y.G., Zhou, X.: A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization. J. Ind. Manag. Optim. 14, 785\u2013801 (2018)","journal-title":"J. Ind. Manag. Optim."},{"key":"1558_CR16","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF02936160","volume":"16","author":"ZS Yu","year":"2004","unstructured":"Yu, Z.S.: On the global convergence of a Levenberg\u2013Marquardt method for constrained nonlinear equation. J. Appl. Math. Comput. 16, 183\u2013194 (2004)","journal-title":"J. Appl. Math. Comput."},{"key":"1558_CR17","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/j.cam.2004.02.013","volume":"172","author":"C Kanzow","year":"2004","unstructured":"Kanzow, C., Yamashita, N., Fukushima, M.: Levenberg\u2013Marquardt methods for constrained nonlinear equations with strong local convergence properties. J. Comput. Appl. Math. 172, 375\u2013397 (2004)","journal-title":"J. Comput. Appl. Math."},{"key":"1558_CR18","first-page":"237","volume":"15","author":"N Yamashita","year":"2001","unstructured":"Yamashita, N., Fukushima, M.: On the rate of convergence of the Levenberg\u2013Marquardt method. Computing 15, 237\u2013249 (2001)","journal-title":"Computing"},{"key":"1558_CR19","volume-title":"Numerical Methods for Nonlinear Algebraic","author":"MJD Powell","year":"1970","unstructured":"Powell, M.J.D.: A hybrid method for solving nonlinear equations. In: Rabinowitz, P. (ed.) Numerical Methods for Nonlinear Algebraic. Gordon and Breach Science, London (1970)"},{"key":"1558_CR20","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1093\/imanum\/7.3.371","volume":"7","author":"R Fletcher","year":"1987","unstructured":"Fletcher, R., Xu, C.X.: Hybrid methods of nonlinear least squares. IMA J. Numer. Anal. 7, 371\u2013389 (1987)","journal-title":"IMA J. Numer. Anal."},{"key":"1558_CR21","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-1-4613-3335-7_7","volume-title":"Advances in Nonlinear Programming","author":"J Nocedal","year":"1998","unstructured":"Nocedal, J., Yuan, Y.X.: Combing trust region and line search techniques. In: Yuan, Y.X. (ed.) Advances in Nonlinear Programming, pp. 153\u2013175. Kluwer Academic, Dordrecht (1998)"},{"key":"1558_CR22","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1186\/1687-1812-2013-69","volume":"2013","author":"SH Khan","year":"2013","unstructured":"Khan, S.H.: A Picard\u2013Mann hybrid iterative process. Fixed Point Theory Appl. 2013, 69 (2013)","journal-title":"Fixed Point Theory Appl."},{"key":"1558_CR23","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10589-012-9455-1","volume":"53","author":"YG Ou","year":"2012","unstructured":"Ou, Y.G., Wang, G.S.: A hybrid ODE-based method for unconstrained optimization problems. Comput. Optim. Appl. 53, 249\u2013270 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"1558_CR24","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/s11075-017-0460-4","volume":"79","author":"M Petrovi\u0107","year":"2018","unstructured":"Petrovi\u0107, M., Rako\u010devi\u0107, V., Kontrec, N., Pani\u0107, S., Ili\u0107, D.: Hybridization of accelerated gradient descent method. Numer. Algorithms 79, 769\u2013786 (2018)","journal-title":"Numer. Algorithms"},{"key":"1558_CR25","doi-asserted-by":"crossref","unstructured":"Petrovic, M.J., Stanimirovic, P.S., Kontrec, N., Mladenovic, J.: Hybrid modification of accelerated double direction method. Math. Prob. Eng. Volume 2018, Article ID 1523267 (2018)","DOI":"10.1155\/2018\/1523267"},{"key":"1558_CR26","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1016\/j.apnum.2011.03.002","volume":"61","author":"YG Ou","year":"2011","unstructured":"Ou, Y.G.: A hybrid trust region algorithm for unconstrained optimization. Appl. Numer. Math. 61, 900\u2013909 (2011)","journal-title":"Appl. Numer. Math."},{"key":"1558_CR27","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., More, J.J.: Benchmarking optimization software with performance profiles. Math. Prog. Ser. A 91, 201\u2013213 (2002)","journal-title":"Math. Prog. Ser. A"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01558-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-020-01558-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01558-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,16]],"date-time":"2022-10-16T06:50:11Z","timestamp":1665903011000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-020-01558-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,21]]},"references-count":27,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["1558"],"URL":"https:\/\/doi.org\/10.1007\/s11590-020-01558-3","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,21]]},"assertion":[{"value":"31 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}