{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:41:33Z","timestamp":1740123693335,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,6,7]],"date-time":"2016-06-07T00:00:00Z","timestamp":1465257600000},"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":["11561015"],"award-info":[{"award-number":["11561015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Natural Science Foundation of China (CN)","award":["11301107","11261014"],"award-info":[{"award-number":["11301107","11261014"]}]},{"DOI":"10.13039\/501100004607","name":"Natural Science Foundation of Guangxi Province","doi-asserted-by":"publisher","award":["2013GXNSFBA019009"],"award-info":[{"award-number":["2013GXNSFBA019009"]}],"id":[{"id":"10.13039\/501100004607","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s11075-016-0155-2","type":"journal-article","created":{"date-parts":[[2016,6,7]],"date-time":"2016-06-07T01:13:05Z","timestamp":1465261985000},"page":"461-479","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Numerical methods for solving some matrix feasibility problems"],"prefix":"10.1007","volume":"74","author":[{"given":"Xue-Feng","family":"Duan","sequence":"first","affiliation":[]},{"given":"Chun-Mei","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jiao-Fen","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yong","family":"Ding","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,7]]},"reference":[{"key":"155_CR1","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.jmaa.2008.01.087","volume":"343","author":"A Aleyner","year":"2008","unstructured":"Aleyner, A., Reich, S.: Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces. J. Math. Anal. Appl. 343, 427\u2013435 (2008)","journal-title":"J. Math. Anal. Appl."},{"key":"155_CR2","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":"155_CR3","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BF01027691","volume":"1","author":"HH Bauschke","year":"1993","unstructured":"Bauschke, H.H., Borwein, J.M.: On the convergence of von Neumann\u2019s alternating projection algorithm for two sets. Set-Valued Analysis 1, 185\u2013212 (1993)","journal-title":"Set-Valued Analysis"},{"key":"155_CR4","doi-asserted-by":"crossref","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex analysis and monotone operator theory in Hilbert spaces. Springer (2011)","DOI":"10.1007\/978-1-4419-9467-7"},{"key":"155_CR5","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s11075-005-9010-6","volume":"41","author":"HH Bauschke","year":"2006","unstructured":"Bauschke, H.H., Combettes, P.L., Kruk, S.G.: Extrapolation algorithm for affine-convex feasibility problems. Numer. Algorithms 41, 239\u2013274 (2006)","journal-title":"Numer. Algorithms"},{"key":"155_CR6","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/978-1-4613-9940-7_3","volume":"37","author":"JP Boyle","year":"1986","unstructured":"Boyle, J.P., Dykstra, R.L.: A method for finding projections onto the intersections of convex sets in Hilbert spaces. Lecture notes in Statistics 37, 28\u201347 (1986)","journal-title":"Lecture notes in Statistics"},{"key":"155_CR7","first-page":"688","volume":"6","author":"LM Bregman","year":"1965","unstructured":"Bregman, L.M.: The method successive projection for finding a common point of convex sets. Soviet Math. Docl. 6, 688\u2013692 (1965)","journal-title":"Soviet Math. Docl."},{"key":"155_CR8","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1090\/S0002-9939-1959-0105008-8","volume":"10","author":"W Cheney","year":"1959","unstructured":"Cheney, W., Goldstein, A.: Proximity maps for convex sets. Proceedings of the AMS 10, 448\u2013450 (1959)","journal-title":"Proceedings of the AMS"},{"key":"155_CR9","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/S0362-546X(04)00265-2","volume":"59","author":"Y Censor","year":"2004","unstructured":"Censor, Y., Pierro, A.R., Zaknoon, M.: Steered sequential projections for the inconsistent convex feasibility problem. Nonlinear Anal. 59, 385\u2013405 (2004)","journal-title":"Nonlinear Anal."},{"key":"155_CR10","volume-title":"Convex Optimization, Euclidean Distance Geometry","author":"J Dattorro","year":"2005","unstructured":"Dattorro, J.: Convex Optimization, Euclidean Distance Geometry. Moo Publishing, NewYork (2005)"},{"key":"155_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10589-007-9073-5","volume":"40","author":"NIM Gould","year":"2008","unstructured":"Gould, N.I.M.: How good are projection methods for convex feasibility problems. Comput. Optim. Appl. 40, 1\u201312 (2008)","journal-title":"Comput. Optim. Appl."},{"key":"155_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0041-5553(67)90113-9","volume":"7","author":"LG Gubin","year":"1997","unstructured":"Gubin, L.G., Polyak, B.T., Raik, E.V.: The method of projections for finding the common point of convex sets. U.S.S.R. Comput. Math. Phys. 7, 1\u201324 (1997)","journal-title":"U.S.S.R. Comput. Math. Phys."},{"key":"155_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-3467-1","volume-title":"Optimization and Dynamical Systems","author":"U Helmke","year":"1994","unstructured":"Helmke, U., Moore, J.B.: Optimization and Dynamical Systems. Springer, London (1994)"},{"key":"155_CR14","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0024-3795(88)90223-6","volume":"103","author":"N Higham","year":"1988","unstructured":"Higham, N.: Computing a nearest symmetric positive semidefinite matrix. Linear Algebra Appl. 103, 103\u2013118 (1988)","journal-title":"Linear Algebra Appl."},{"key":"155_CR15","doi-asserted-by":"crossref","first-page":"107902","DOI":"10.1103\/PhysRevLett.90.107902","volume":"90","author":"A Higuchi","year":"2003","unstructured":"Higuchi, A., Sudbury, A., Szulc, J.: One-Qubit Reduced States of a Pure Many-Qubit State: Polygon Inequalities. Phys. Rev. Lett. 90, 107902 (2003)","journal-title":"Phys. Rev. Lett."},{"key":"155_CR16","first-page":"17","volume":"57","author":"JF Li","year":"2014","unstructured":"Li, J.F., Hu, X.Y., Zhang, L.: Relaxed alternating projection method for solving linear matrix equation under closed convex constraints. Acta Math. Sinica (Chinese Series) 57, 17\u201334 (2014)","journal-title":"Acta Math. Sinica (Chinese Series)"},{"key":"155_CR17","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1287\/moor.1070.0291","volume":"33","author":"AS Lewis","year":"2008","unstructured":"Lewis, A.S., Malick, J.: Alternating projections on manifolds. Math. Operat. Res. 33, 216\u2013234 (2008)","journal-title":"Math. Operat. Res."},{"key":"155_CR18","doi-asserted-by":"crossref","first-page":"5421","DOI":"10.1016\/j.apm.2014.04.030","volume":"38","author":"N Lu","year":"2014","unstructured":"Lu, N., Ma, F., Liu, S.Y.: A non-interior continuation algorithm for solving the convex feasibility problem. Appl. Math. model. 38, 5421\u20135430 (2014)","journal-title":"Appl. Math. model."},{"key":"155_CR19","volume-title":"Inequalities: Theory of Majorization and Its Applications","author":"AW Marshall","year":"1979","unstructured":"Marshall, A.W., Olkin, I.: Inequalities: Theory of Majorization and Its Applications. Academic Press, New York (1979)"},{"key":"155_CR20","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.na.2012.11.013","volume":"79","author":"A Moudafi","year":"2013","unstructured":"Moudafi, A.: A relaxed alternating CQ-algorithm for convex feasibility problems. Nonlinear Anal. 79, 117\u2013121 (2013)","journal-title":"Nonlinear Anal."},{"key":"155_CR21","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"key":"155_CR22","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0024-3795(85)90280-0","volume":"64","author":"ARD Pierro","year":"1985","unstructured":"Pierro, A.R.D., Iusem, A.N.: A simultaneous projections method for linear inequalities. Linear Algebra Appl. 64, 243\u2013253 (1985)","journal-title":"Linear Algebra Appl."},{"key":"155_CR23","doi-asserted-by":"crossref","first-page":"4035","DOI":"10.1063\/1.1776642","volume":"45","author":"O Rudolph","year":"2004","unstructured":"Rudolph, O.: On extremal quantum states of composite systems with fixed marginals. J. Math. Phys. 45, 4035\u20134041 (2004)","journal-title":"J. Math. Phys."},{"key":"155_CR24","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1137\/070704575","volume":"20","author":"J Malick","year":"2009","unstructured":"Malick, J., Povh, J., Rendl, F., Wiegele, A.: Regularization methods for semidefinite programming. SIAM J. Optim. 20, 336\u2013356 (2009)","journal-title":"SIAM J. Optim."},{"key":"155_CR25","first-page":"509","volume":"62","author":"YN Yang","year":"2013","unstructured":"Yang, Y.N., Yang, Q.Z.: Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem. J. Math. Program. Oper. Res. 62, 509\u2013525 (2013)","journal-title":"J. Math. Program. Oper. Res."},{"key":"155_CR26","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1080\/00207160701458344","volume":"84","author":"MS Wei","year":"2007","unstructured":"Wei, M.S., Wang, Q.: On rank-constrained Hermitian nonnegative-definite least squares solutions to the matrix equation A X A h = B. Inter. J. Comput. Math. 84, 945\u2013952 (2007)","journal-title":"Inter. J. Comput. Math."},{"key":"155_CR27","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.jat.2013.07.012","volume":"175","author":"AJ Zaslavski","year":"2013","unstructured":"Zaslavski, A.J.: Subgradient projection algorithms for convex feasibility problems in the presence of computational errors. J. Approxi. Theory 175, 19\u201342 (2013)","journal-title":"J. Approxi. Theory"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-016-0155-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-016-0155-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-016-0155-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-016-0155-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T11:51:49Z","timestamp":1498305109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-016-0155-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,7]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["155"],"URL":"https:\/\/doi.org\/10.1007\/s11075-016-0155-2","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2016,6,7]]}}}