{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T11:53:21Z","timestamp":1757591601460,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,11,10]],"date-time":"2016-11-10T00:00:00Z","timestamp":1478736000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11271226","11271233"],"award-info":[{"award-number":["11271226","11271233"]}],"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":[[2017,5]]},"DOI":"10.1007\/s10589-016-9884-3","type":"journal-article","created":{"date-parts":[[2016,11,10]],"date-time":"2016-11-10T13:11:43Z","timestamp":1478783503000},"page":"175-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Analysis on Newton projection method for the split feasibility problem"],"prefix":"10.1007","volume":"67","author":[{"given":"Biao","family":"Qu","sequence":"first","affiliation":[]},{"given":"Changyu","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Naihua","family":"Xiu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,10]]},"reference":[{"key":"9884_CR1","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF02142692","volume":"8","author":"Y Censor","year":"1994","unstructured":"Censor, Y., Elfving, T.: A multiprojection algorithm using Bregman projections in a product space. Numer. Algorithms 8, 221\u2013239 (1994)","journal-title":"Numer. Algorithms"},{"key":"9884_CR2","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1088\/0266-5611\/18\/2\/310","volume":"18","author":"CL Byrne","year":"2002","unstructured":"Byrne, C.L.: Iterative oblique projection onto convex sets and the split feasibility problem. Inverse Probl. 18, 441\u2013453 (2002)","journal-title":"Inverse Probl."},{"key":"9884_CR3","doi-asserted-by":"crossref","first-page":"1261","DOI":"10.1088\/0266-5611\/20\/4\/014","volume":"20","author":"QZ Yang","year":"2004","unstructured":"Yang, Q.Z.: The relaxed CQ algorithm solving the split feasibility problem. Inverse Probl. 20, 1261\u20131266 (2004)","journal-title":"Inverse Probl."},{"issue":"5\u20136","key":"9884_CR4","doi-asserted-by":"crossref","first-page":"1218","DOI":"10.1016\/j.laa.2007.03.002","volume":"428","author":"B Qu","year":"2008","unstructured":"Qu, B., Xiu, N.H.: A new halfspace-relaxation projection method for the split feasibility problem. Linear Algebra Appl. 428(5\u20136), 1218\u20131229 (2008)","journal-title":"Linear Algebra Appl."},{"key":"9884_CR5","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S1570-579X(01)80008-2","volume-title":"Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications","author":"CL Byrne","year":"2001","unstructured":"Byrne, C.L.: Bregman\u2013Legendre mulidistance projection algorithms for convex feasibility and optimization. In: Butnairu, D., Censor, Y., Reich, S. (eds.) Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications, pp. 87\u2013100. Elsevier, Amsterdam (2001)"},{"key":"9884_CR6","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1080\/01630563.2014.895755","volume":"35","author":"BH Liu","year":"2014","unstructured":"Liu, B.H., Qu, B., Zheng, N.: A successive projection algorithm for solving the multiple-sets split feasibility problem. Numer. Funct. Anal. Optim. 35, 1459\u20131466 (2014)","journal-title":"Numer. Funct. Anal. Optim."},{"key":"9884_CR7","doi-asserted-by":"crossref","first-page":"1655","DOI":"10.1088\/0266-5611\/21\/5\/009","volume":"21","author":"B Qu","year":"2005","unstructured":"Qu, B., Xiu, N.H.: A note on the CQ algorithm for the split feasibility problem. Inverse Probl. 21, 1655\u20131665 (2005)","journal-title":"Inverse Probl."},{"key":"9884_CR8","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1023\/A:1008714607737","volume":"16","author":"CY Wang","year":"2000","unstructured":"Wang, C.Y., Xiu, N.H.: Convergence of the gradient projection method for generalized convex minimization. Comput. Optim. Appl. 16, 111\u2013120 (2000)","journal-title":"Comput. Optim. Appl."},{"key":"9884_CR9","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"HH Bauschke","year":"1996","unstructured":"Bauschke, H.H., Borwein, J.M.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38, 367\u2013426 (1996)","journal-title":"SIAM Rev."},{"key":"9884_CR10","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1088\/0266-5611\/20\/1\/006","volume":"20","author":"CL Byrne","year":"2004","unstructured":"Byrne, C.L.: A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Probl. 20, 103\u2013120 (2004)","journal-title":"Inverse Probl."},{"key":"9884_CR11","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/S0377-0427(02)00730-6","volume":"152","author":"NH Xiu","year":"2003","unstructured":"Xiu, N.H., Zhang, J.Z.: Some recent advances in projection-type methods for variational inequalities. J. Comput. Appl. Math. 152, 559\u2013585 (2003)","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"9884_CR12","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10107-007-0196-3","volume":"118","author":"KF Ito","year":"2009","unstructured":"Ito, K.F., Kunisch, K.: On a semi-smooth Newton method and its globalization. Math. Program. 118(2), 347\u2013370 (2009)","journal-title":"Math. Program."},{"key":"9884_CR13","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/978-3-7643-7721-2_8","volume":"155","author":"KF Ito","year":"2007","unstructured":"Ito, K.F., Kunisch, K.: Applications of semi-smooth Newton methods to variational inequalities. Int. Ser. Numer. Math. 155, 175\u2013192 (2007)","journal-title":"Int. Ser. Numer. Math."},{"key":"9884_CR14","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s10589-007-9029-9","volume":"37","author":"C Kanzow","year":"2007","unstructured":"Kanzow, C., Klug, A.: An interior-point affine scaling trust region method for semismooth equations with box constraints. Comput. Optim. Appl. 37, 329\u2013353 (2007)","journal-title":"Comput. Optim. Appl."},{"key":"9884_CR15","doi-asserted-by":"crossref","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":"9884_CR16","first-page":"315","volume":"10","author":"HD Qi","year":"1999","unstructured":"Qi, H.D.: A regularized smoothing Newton method for box constrained variational inequality problems with P $$_0$$ 0 -functions. SIAM J. Optim. 10, 315\u2013330 (1999)","journal-title":"SIAM J. Optim."},{"key":"9884_CR17","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s10107-002-0305-2","volume":"94","author":"D Sun","year":"2002","unstructured":"Sun, D., Womersley, R.S., Qi, H.D.: A feasible semismooth asymptocially Newton method for mixed complementarity problems. Math. Program. 94, 167\u2013187 (2002)","journal-title":"Math. Program."},{"issue":"4","key":"9884_CR18","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1137\/S1052623401390537","volume":"13","author":"W Huyer","year":"2003","unstructured":"Huyer, W., Neumaier, A.: A new exact penalty function. SIAM J. Optim. 13(4), 1141\u20131158 (2003)","journal-title":"SIAM J. Optim."},{"key":"9884_CR19","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1023\/A:1012996232707","volume":"103","author":"DH Li","year":"2001","unstructured":"Li, D.H., Fukushima, M.: Globally convergent Broyden-like methods for semismooth equations and applications to VIP, NCP and MCP. Ann. Oper. Res. 103, 71\u201379 (2001)","journal-title":"Ann. Oper. Res."},{"key":"9884_CR20","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0377-0427(00)00541-0","volume":"129","author":"D Sun","year":"2001","unstructured":"Sun, D., Qi, L.: Solving variational inequality problems via smoothing-nonsmooth reformulations. J. Comput. Appl. Math. 129, 37\u201362 (2001)","journal-title":"J. Comput. Appl. Math."},{"key":"9884_CR21","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s10589-012-9524-5","volume":"55","author":"CY Wang","year":"2013","unstructured":"Wang, C.Y., Liu, Q., Ma, C.: Smoothing SQP algorithm for semismooth equations with box constraints. Comput. Optim. Appl. 55, 399\u2013425 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"9884_CR22","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s10898-013-0033-6","volume":"58","author":"ZG Zhou","year":"2014","unstructured":"Zhou, Z.G., Yu, B.: A smoothing homotopy method for variational inequality problems on polyhedral convex sets. J. Glob. Optim. 58, 151\u2013168 (2014)","journal-title":"J. Glob. Optim."},{"key":"9884_CR23","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s10589-014-9679-3","volume":"59","author":"P Armand","year":"2014","unstructured":"Armand, P., Benoist, J., Omheni, R., Pateloup, V.: Study of a primal-dual algorithm for equality constrained minimization. Comput. Optim. Appl. 59, 405\u2013433 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"9884_CR24","first-page":"55","volume":"83","author":"C Kanzow","year":"1998","unstructured":"Kanzow, C., Fukushima, M.: Theoretical and numerical investgation of the D-gap function for box constrained variational inequalities. Math. Program. 83, 55\u201387 (1998)","journal-title":"Math. Program."},{"key":"9884_CR25","first-page":"706","volume":"3","author":"JM Liu","year":"1994","unstructured":"Liu, J.M.: Linear stability of generalized equation part I: basic theory. Math. Oper. Res. 3, 706\u2013720 (1994)","journal-title":"Math. Oper. Res."},{"key":"9884_CR26","first-page":"721","volume":"3","author":"JM Liu","year":"1994","unstructured":"Liu, J.M.: Linear stability of generalized equation part II: applications to nonlinear programming. Math. Oper. Res. 3, 721\u2013742 (1994)","journal-title":"Math. Oper. Res."},{"key":"9884_CR27","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1137\/S0363012992240527","volume":"33","author":"JM Liu","year":"1995","unstructured":"Liu, J.M.: Strong stability in variational inequalities. SIAM J. Control Optim. 33, 725\u2013749 (1995)","journal-title":"SIAM J. Control Optim."},{"key":"9884_CR28","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s101070050094","volume":"86","author":"JM Peng","year":"1999","unstructured":"Peng, J.M., Fukushima, M.: A hybrid Newton method for solving the variational inequality problem via the D-gap function. Math. Program. 86, 367\u2013386 (1999)","journal-title":"Math. Program."},{"key":"9884_CR29","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1287\/moor.5.1.43","volume":"5","author":"SM Robinson","year":"1980","unstructured":"Robinson, S.M.: Strongly regular generalized equations. Math. Oper. Res. 5, 43\u201362 (1980)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"9884_CR30","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1137\/S1052623498337546","volume":"10","author":"MV Solodov","year":"2000","unstructured":"Solodov, M.V., Svaiter, B.F.: A trully globally convergent Newton-type method for the monotone nonlinear complementarity problem. SIAM J. Optim. 10(2), 605\u2013625 (2000)","journal-title":"SIAM J. Optim."},{"key":"9884_CR31","first-page":"452","volume-title":"Complementarity and Variational Problems: State of the Art","author":"D Sun","year":"1997","unstructured":"Sun, D., Fukushima, M., Qi, L.: A computable generalized Hessian of the D-gap function and Newton-type methods for variational inequality problems. In: Ferris, M.C., Pang, J.S. (eds.) Complementarity and Variational Problems: State of the Art, pp. 452\u2013472. SIAM, Philadelphia (1997)"},{"key":"9884_CR32","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF01581276","volume":"58","author":"K Taji","year":"1993","unstructured":"Taji, K., Fukushima, M., Ibaraki, T.: A globally convergent Newton method for solving strongly monotone variational inequalities. Math. Program. 58, 369\u2013383 (1993)","journal-title":"Math. Program."},{"key":"9884_CR33","volume-title":"Optimization and Nonsmooth Analysis","author":"FH Clarke","year":"1983","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley, New York (1983)"},{"key":"9884_CR34","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01442169","volume":"11","author":"JB Hiriart-Urruty","year":"1984","unstructured":"Hiriart-Urruty, J.B., Strodiot, J.J., Hien Nguyen, V.: Generalized Hessian matrix and second-order optimality conditions for problems with $$C^{1,1}$$ C 1 , 1 data. Appl. Math. Optim. 11, 43\u201356 (1984)","journal-title":"Appl. Math. Optim."},{"key":"9884_CR35","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1137\/0315061","volume":"15","author":"M Mifflin","year":"1977","unstructured":"Mifflin, M.: Semismooth and semiconvex functions in constrained optimization. SIAM J. Control Optim. 15, 957\u2013972 (1977)","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"9884_CR36","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01582255","volume":"48","author":"P Harker","year":"1990","unstructured":"Harker, P., Pang, J.S.: Finite-demensional variational inequalities and complementarity problems: a survey of theory, algorithms and applications. Math. Program. 48(1), 161\u2013220 (1990)","journal-title":"Math. Program."},{"key":"9884_CR37","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/j.amc.2015.04.056","volume":"262","author":"B Qu","year":"2015","unstructured":"Qu, B., Liu, B.H., Zheng, N.: On the computation of the step-size for the CQ-like algorithms for the split feasibility problem. Appl. Math. Comput. 262, 218\u2013223 (2015)","journal-title":"Appl. Math. Comput."},{"key":"9884_CR38","doi-asserted-by":"crossref","first-page":"1644","DOI":"10.1016\/j.amc.2012.08.005","volume":"219","author":"JL Zhao","year":"2012","unstructured":"Zhao, J.L., Zhang, Y.J., Yang, Q.Z.: Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem. Appl. Math. Comput. 219, 1644\u20131653 (2012)","journal-title":"Appl. Math. Comput."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9884-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-016-9884-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9884-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,27]],"date-time":"2020-09-27T06:51:12Z","timestamp":1601189472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-016-9884-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,10]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["9884"],"URL":"https:\/\/doi.org\/10.1007\/s10589-016-9884-3","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2016,11,10]]}}}