{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T14:54:01Z","timestamp":1766588041638},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1997,5]]},"DOI":"10.1007\/bf02614621","type":"journal-article","created":{"date-parts":[[2007,4,28]],"date-time":"2007-04-28T00:54:01Z","timestamp":1177721641000},"page":"335-355","source":"Crossref","is-referenced-by-count":11,"title":["Two generalizations of Dykstra\u2019s cyclic projections algorithm"],"prefix":"10.1007","volume":"77","author":[{"given":"Hein","family":"Hundal","sequence":"first","affiliation":[]},{"given":"Frank","family":"Deutsch","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02614621_CR1","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1006\/jath.1994.1136","volume":"79","author":"H.H. Bauschke","year":"1994","unstructured":"H.H. Bauschke and J.M. Borwein, Dykstra\u2019s alternating projection algorithm for two sets,Journal of Approximation Theory 79 (1994) 418\u2013443.","journal-title":"Journal of Approximation Theory"},{"key":"BF02614621_CR2","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"H.H. Bauschke","year":"1996","unstructured":"H.H. Bauschke and J.M. Borwein, On projection algorithms for solving convex feasibility problems,SIAM Review 38 (1996) 367\u2013426.","journal-title":"SIAM Review"},{"key":"BF02614621_CR3","first-page":"28","volume-title":"Advances in Order Restricted Statistical Inference","author":"J.P. Boyle","year":"1985","unstructured":"J.P. Boyle and R.L. Dykstra, A method for finding projections onto the intersection of convex sets in Hilbert spaces, in:Advances in Order Restricted Statistical Inference, Lecture Notes in Statistics (Springer, New York, 1985) 28\u201347."},{"key":"BF02614621_CR4","first-page":"688","volume":"162","author":"L.M. Bregman","year":"1965","unstructured":"L.M. Bregman. The method of successive projection for finding a common point of convex sets,Doklady 162 (1965) 688\u2013692","journal-title":"Doklady"},{"key":"BF02614621_CR5","first-page":"83","volume-title":"Convexity and Graph Theory","author":"Y. Censor","year":"1984","unstructured":"Y. Censor, Iterative methods for the convex feasibility problem, in: M. Rosenfeld and J. Zaks, eds.,Convexity and Graph Theory (North-Holland, Amsterdam, 1984) 83\u201391."},{"key":"BF02614621_CR6","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-94-011-2634-2_5","volume-title":"Approximation Theory, Spline Functions and Applications","author":"E. Deutsch","year":"1992","unstructured":"E. Deutsch, The method of alternating orthogonal projections, in: S.P. Singh, ed.,Approximation Theory, Spline Functions and Applications (Kluwer Academic Publishers, Boston, MA, 1992) 105\u2013121."},{"key":"BF02614621_CR7","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1080\/01630569408816580","volume":"15","author":"F. Deutsch","year":"1994","unstructured":"F. Deutsch and H. Hundal. The rate of convergence of Dykstra\u2019s cyclic projections algorithm: The polyhedral case,Numerical Fwtctional Analysis and Optimization 15 (1994) 537\u2013565.","journal-title":"Numerical Fwtctional Analysis and Optimization"},{"key":"BF02614621_CR8","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1080\/01621459.1983.10477029","volume":"78","author":"R.L. Dykstra","year":"1983","unstructured":"R.L. Dykstra, An algorithm for restricted least squares regression.Journal of the American Statistical Association 78 (1983) 837\u2013842.","journal-title":"Journal of the American Statistical Association"},{"key":"BF02614621_CR9","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF02614077","volume":"36","author":"N. Gaffke","year":"1989","unstructured":"N. Gaffke and R. Mathar, A cyclic projection algorithm via duality,Metrika 36 (1989) 29\u201354","journal-title":"Metrika"},{"key":"BF02614621_CR10","first-page":"96","volume":"23","author":"I. Halperin","year":"1962","unstructured":"I. Halperin, The product of projection operators,Acta Scientia Mathematica (Szeged) 23 (1962) 96\u201399.","journal-title":"Acta Scientia Mathematica (Szeged)"},{"key":"BF02614621_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01580719","volume":"40","author":"S.P. Han","year":"1988","unstructured":"S.P. Han, A successive projection method,Mathematical Programming 40 (1988) 1\u201314.","journal-title":"Mathematical Programming"},{"key":"BF02614621_CR12","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/nav.3800040113","volume":"4","author":"C. Hildreth","year":"1957","unstructured":"C. Hildreth, A quadratic programming procedure,Naval Research Logistics Quarterly 4 (1957) 79\u201385 [Erratum,ibid., 361].","journal-title":"Naval Research Logistics Quarterly"},{"key":"BF02614621_CR13","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF01580851","volume":"47","author":"A.N. Iusem","year":"1990","unstructured":"A.N. Iusem and A.R. De Pierro, On the convergence rate of Hildreth\u2019s quadratic programming algorithm,Mathematical Programming 47 (1990) 37\u201351.","journal-title":"Mathematical Programming"},{"key":"BF02614621_CR14","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01582891","volume":"52","author":"A.N. Iusem","year":"1991","unstructured":"A.N. Iusem and A.R. De Pierro, On the convergence of Han\u2019s method for convex programming with quadratic objective.Mathematical Programming 52 (1991) 265\u2013284.","journal-title":"Mathematical Programming"},{"key":"BF02614621_CR15","volume-title":"Functional Operators. Vol. II. The Geometry of Orthogonal Spaces","author":"J. Neumann von","year":"1950","unstructured":"J. von Neumann,Functional Operators. Vol. II. The Geometry of Orthogonal Spaces (Princeton University Press, Princeton, NJ, 1950)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02614621.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02614621\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02614621","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T04:49:27Z","timestamp":1558327767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02614621"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,5]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["BF02614621"],"URL":"https:\/\/doi.org\/10.1007\/bf02614621","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,5]]}}}