{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:29:29Z","timestamp":1742927369292,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":46,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_143","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:05:19Z","timestamp":1219662319000},"page":"828-833","source":"Crossref","is-referenced-by-count":1,"title":["Dykstra\u2019s Algorithm and Robust Stopping Criteria"],"prefix":"10.1007","author":[{"given":"Ernesto G.","family":"Birgin","sequence":"first","affiliation":[]},{"given":"Marcos","family":"Raydan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"143_CR1_143","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1006\/jmaa.1996.0308","volume":"202","author":"HH Bauschke","year":"1996","unstructured":"Bauschke HH (1996) The approximation of fixed\n points of compositions of nonexpansive mappings in Hilbert space.\n J\u00a0Math Anal Appl 202:150\u2013159","journal-title":"J Math Anal Appl"},{"key":"143_CR2_143","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1006\/jath.1994.1136","volume":"79","author":"HH Bauschke","year":"1994","unstructured":"Bauschke HH, Borwein JM (1994) Dykstra's\n alternating projection algorithm for two sets. J\u00a0Approx\n Theory 79:418\u2013443","journal-title":"J Approx Theory"},{"key":"143_CR3_143","first-page":"27","volume":"4","author":"HH Bauschke","year":"1997","unstructured":"Bauschke HH, Borwein JM (1997) Legendre\n functions and the method of random Bregman projections. J\u00a0Convex Anal 4:27\u201367","journal-title":"J Convex Anal"},{"key":"143_CR4_143","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1080\/02331930008844513","volume":"48","author":"HH Bauschke","year":"2000","unstructured":"Bauschke HH, Lewis AS (2000) Dykstra's\n algorithm with Bregman projections: a\u00a0convergence proof. Optim  48:409\u2013427","journal-title":"Optim"},{"key":"143_CR5_143","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1093\/imanum\/23.4.539","volume":"23","author":"EG Birgin","year":"2003","unstructured":"Birgin EG, Mart\u00ednez JM, Raydan M (2003)\n Inexact spectral gradient method for convex-constrained\n optimization. IMA J Numer Anal 23:539\u2013559","journal-title":"IMA J Numer Anal"},{"key":"143_CR6_143","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1137\/03060062X","volume":"26","author":"EG Birgin","year":"2005","unstructured":"Birgin EG, Raydan M (2005) Robust stopping\n criteria for Dykstra's algorithm. SIAM J Sci Comput 26:1405\u20131414","journal-title":"SIAM J Sci Comput"},{"key":"143_CR7_143","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 JP, Dykstra RL (1986) A\u00a0method for\n finding projections onto the intersection of convex sets in Hilbert\n spaces. Lect Notes Stat 37:28\u201347","journal-title":"Lect Notes Stat"},{"key":"143_CR8_143","first-page":"319","volume":"6","author":"LM Bregman","year":"1999","unstructured":"Bregman LM, Censor Y, Reich S (1999)\n Dykstra's algorithm as the nonlinear extension of Bregman's\n optimization method. J\u00a0Convex Anal 6:319\u2013333","journal-title":"J Convex Anal"},{"key":"143_CR9_143","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.jat.2003.08.004","volume":"124","author":"LM Bregman","year":"2003","unstructured":"Bregman LM, Censor Y, Reich S,\n Zepkowitz-Malachi Y (2003) Finding the projection of a\u00a0point onto\n the intersection of convex sets via projections onto halfspaces.\n J\u00a0Approx Theory 124:194\u2013218","journal-title":"J Approx Theory"},{"key":"143_CR10_143","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1137\/0913010","volume":"13","author":"R Bramley","year":"1992","unstructured":"Bramley R, Sameh A (1992) Row projection\n methods for large non symmetric linear systems. J\u00a0Sci\n Statist Comp 13:168\u2013193","journal-title":"J Sci Statist Comp"},{"key":"143_CR11_143","first-page":"319","volume":"6","author":"LM Bregman","year":"1999","unstructured":"Bregman LM, Censor Y, Reich S (1999)\n Dykstra's algorithm as the nonlinear extension of Bregman's\n optimization method. J\u00a0Convex Anal 6:319\u2013333","journal-title":"J Convex Anal"},{"key":"143_CR12_143","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.laa.2005.10.006","volume":"416","author":"Y Censor","year":"2006","unstructured":"Censor Y (2006) Computational acceleration of\n projection algorithms for the linear best approximation problem.\n Linear Algebr Appl 416:111\u2013123","journal-title":"Linear Algebr Appl"},{"key":"143_CR13_143","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/0168-9274(87)90028-6","volume":"3","author":"Y Censor","year":"1987","unstructured":"Censor Y, Herman GT (1987) On some\n optimization techniques in image reconstruction from projections.\n Appl Numer Math 3:365\u2013391","journal-title":"Appl Numer Math"},{"key":"143_CR14_143","first-page":"407","volume":"2","author":"Y Censor","year":"1998","unstructured":"Censor Y, Reich S (1998) The Dykstra's\n algorithm with Bregman projections. Commun Appl\n Anal 2:407\u2013419","journal-title":"Commun Appl Anal"},{"key":"143_CR15_143","doi-asserted-by":"publisher","first-page":"448","DOI":"10.2307\/2032864","volume":"10","author":"W Cheney","year":"1959","unstructured":"Cheney W, Goldstein A (1959) Proximity maps\n for convex sets. Proc Am Math Soc 10:448\u2013450","journal-title":"Proc Am Math Soc"},{"key":"143_CR16_143","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S1076-5670(08)70157-5","volume":"95","author":"PL Combettes","year":"1996","unstructured":"Combettes PL (1996) The convex feasibility\n problem in image recovery. Adv Imag Electron\n Phys 95:155\u2013270","journal-title":"Adv Imag Electron Phys"},{"key":"143_CR17_143","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9298-9","volume-title":"Best Approximation in Inner Product Spaces","author":"F Deutsch","year":"2001","unstructured":"Deutsch F (2001) Best Approximation in\n Inner Product Spaces. Springer, New York"},{"key":"143_CR18_143","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1080\/01630569408816580","volume":"15","author":"F Deutsch","year":"1994","unstructured":"Deutsch F, Hundal H (1994) The rate of\n convergence of Dykstra's cyclic projections algorithm: the\n polyhedral case. Numer Funct Anal Optim 15:537\u2013565","journal-title":"Numer Funct Anal Optim"},{"key":"143_CR19_143","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/978-94-015-8577-4_5","volume-title":"Approximation Theory, Wavelets and Applications","author":"F Deutsch","year":"1995","unstructured":"Deutsch F (1995) Dykstra's cyclic projections\n algorithm: the rate of convergence. In: Singh SP (ed) Approximation Theory,\n Wavelets and Applications. Kluwer, Dordrecht, pp\u00a087\u201394"},{"key":"143_CR20_143","doi-asserted-by":"publisher","first-page":"837","DOI":"10.2307\/2288193","volume":"78","author":"RL Dykstra","year":"1983","unstructured":"Dykstra RL (1983) An algorithm for restricted\n least-squares regression. J\u00a0Am Stat Assoc 78:837\u2013842","journal-title":"J Am Stat Assoc"},{"key":"143_CR21_143","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1590\/S0101-82052003000100001","volume":"22","author":"MG Eberle","year":"2003","unstructured":"Eberle MG, Maciel MC (2003) Finding the\n Closest Toeplitz Matrix. Comput Appl Math 22:1\u201318","journal-title":"Comput Appl Math"},{"key":"143_CR22_143","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1002\/(SICI)1099-1506(199611\/12)3:6<459::AID-NLA82>3.0.CO;2-S","volume":"3","author":"R Escalante","year":"1996","unstructured":"Escalante R, Raydan M (1996) Dykstra's\n Algorithm for a\u00a0Constrained Least-Squares Matrix Problem. Numer Linear Algebr Appl 3:459\u2013471","journal-title":"Numer Linear Algebr Appl"},{"key":"143_CR23_143","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0898-1221(98)00020-0","volume":"35","author":"R Escalante","year":"1998","unstructured":"Escalante R, Raydan M (1998) On Dykstra's\n algorithm for constrained least-squares rectangular matrix problems.\n Comput Math Appl 35:73\u201379","journal-title":"Comput Math Appl"},{"key":"143_CR24_143","doi-asserted-by":"crossref","unstructured":"Gaffke N, Mathar R (1986) A\u00a0cyclic\n projection algorithm via duality. Metr 36:29\u201354","DOI":"10.1007\/BF02614077"},{"key":"143_CR25_143","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1023\/A:1019192926247","volume":"21","author":"UM Garcia-Palomares","year":"1999","unstructured":"Garcia-Palomares UM (1999) Preconditioning\n projection methods for solving algebraic linear systems. Numer Algorithm 21:157\u2013164","journal-title":"Numer Algorithm"},{"key":"143_CR26_143","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1093\/imanum\/15.2.291","volume":"15","author":"W Glunt","year":"1995","unstructured":"Glunt W (1995) An alternating projection method\n for certain linear problems in a\u00a0Hilbert space. IMA J Numer Anal 15:291\u2013305","journal-title":"IMA J Numer Anal"},{"key":"143_CR27_143","doi-asserted-by":"crossref","unstructured":"Glunt W, Hayden TL, Hong S, Wells J\n (1990) An alternating projection algorithm for computing the\n nearest Euclidean distance matrix. SIAM J Matrix Anal Appl 11:589\u2013600","DOI":"10.1137\/0611042"},{"key":"143_CR28_143","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1002\/jcc.540140115","volume":"14","author":"W Glunt","year":"1993","unstructured":"Glunt W, Hayden TL, Raydan M (1993) Molecular\n conformations from distance matrices. J\u00a0Comput Chem 14:114\u2013120","journal-title":"J Comput Chem"},{"key":"143_CR29_143","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1016\/S0092-8240(05)80232-0","volume":"53","author":"W Glunt","year":"1991","unstructured":"Glunt W, Hayden TL, Liu WM (1991) The\n embedding problem for predistance matrices. Bull\n Math Biol 53:769\u2013796","journal-title":"Bull Math Biol"},{"key":"143_CR30_143","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01580719","volume":"40","author":"SP Han","year":"1988","unstructured":"Han SP (1988) A\u00a0successive projection method. Math Program 40:1\u201314","journal-title":"Math Program"},{"key":"143_CR31_143","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s11075-004-5882-0","volume":"38","author":"LM Hern\u00e1ndez-Ramos","year":"2005","unstructured":"Hern\u00e1ndez-Ramos LM (2005) Alternating oblique\n projections for coupled linear systems. Numer Algorithm 38:285\u2013303","journal-title":"Numer Algorithm"},{"key":"143_CR32_143","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1093\/imanum\/22.3.329","volume":"22","author":"N Higham","year":"2002","unstructured":"Higham N (2002) Computing the nearest\n correlation matrix\u00a0\u2013 a\u00a0problem from finance. IMA J Numer\n Anal 22:329\u2013343","journal-title":"IMA J Numer Anal"},{"key":"143_CR33_143","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/nav.3800040113","volume":"4","author":"C Hildreth","year":"1957","unstructured":"Hildreth C (1957) A\u00a0quadratic programming\n procedure. Naval Res Log Quart 4:79\u201385","journal-title":"Naval Res Log Quart"},{"key":"143_CR34_143","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/0167-7152(91)90006-D","volume":"12","author":"H Hu","year":"1991","unstructured":"Hu H, Olkin I (1991) A\u00a0numerical procedure\n for finding the positive definite matrix closest to a\u00a0patterned\n matrix. Stat Probab Lett 12:511\u2013515","journal-title":"Stat Probab Lett"},{"key":"143_CR35_143","first-page":"335","volume":"77","author":"H Hundal","year":"1997","unstructured":"Hundal H, Deutsch F (1997) Two\n generalizations of Dykstra's cyclic projections algorithm. Math Program 77:335\u2013355","journal-title":"Math Program"},{"key":"143_CR36_143","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF01580851","volume":"47","author":"A Iusem","year":"1990","unstructured":"Iusem A, De Pierro A (1990) On the\n convergence properties of Hildreth's quadratic programming\n algorithm. Math Prog 47:37\u201351","journal-title":"Math Prog"},{"key":"143_CR37_143","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01582891","volume":"52","author":"A Iusem","year":"1991","unstructured":"Iusem A, De Pierro A (1991) On the\n convergence of Han's method for convex programming with quadratic\n objective. Math Prog 52:265\u2013284","journal-title":"Math Prog"},{"key":"143_CR38_143","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF01582569","volume":"64","author":"A Iusem","year":"1995","unstructured":"Iusem A, Svaiter BF (1995) A\u00a0row-action\n method for convex programming. J\u00a0Math Prog 64:149\u2013171","journal-title":"J Math Prog"},{"key":"143_CR39_143","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF02193462","volume":"86","author":"A Iusem","year":"1995","unstructured":"Iusem A, Svaiter BF (1995) Primal-dual\n row-action method for convex programming. J\u00a0Optim\n Theor Appl 86:73\u2013112","journal-title":"J Optim Theor Appl"},{"key":"143_CR40_143","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1137\/0318033","volume":"18","author":"A Lent","year":"1980","unstructured":"Lent A, Censor Y (1980) Extensions of\n Hildreth's row-action method for quadratic programming. SIAM\n J Control Optim 18:444\u2013454","journal-title":"SIAM J Control Optim"},{"key":"143_CR41_143","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1002\/(SICI)1099-1506(199811\/12)5:6<461::AID-NLA141>3.0.CO;2-V","volume":"5","author":"M Mendoza","year":"1998","unstructured":"Mendoza M, Raydan M, Tarazaga P (1998)\n Computing the nearest diagonally dominant matrix. Numer\n Linear Algebr Appl 5:461\u2013474","journal-title":"Numer Linear Algebr Appl"},{"key":"143_CR42_143","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0096-3003(02)00478-2","volume":"145","author":"M Monsalve","year":"2003","unstructured":"Monsalve M, Moreno J, Escalante R, Raydan M\n (2003) Selective alternating projections to find the nearest SSD+\n matrix. Appl Math Comput 145:205\u2013220","journal-title":"Appl Math Comput"},{"key":"143_CR43_143","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.amc.2004.06.136","volume":"167","author":"PM Morillas","year":"2005","unstructured":"Morillas PM (2005) Dykstra's algorithm with\n strategies for projecting onto certain polyhedral cones. Appl Math Comput 167:635\u2013649","journal-title":"Appl Math Comput"},{"key":"143_CR44_143","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1137\/S0036142900367557","volume":"40","author":"C Perkins","year":"2002","unstructured":"Perkins C (2002) A\u00a0Convergence Analysis of\n Dykstra's Algorithm for Polyhedral Sets. SIAM J Numer Anal\n 40:792\u2013804","journal-title":"SIAM J Numer Anal"},{"key":"143_CR45_143","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1002\/nla.277","volume":"9","author":"M Raydan","year":"2002","unstructured":"Raydan M, Tarazaga P (2002) Primal and\n polar approach for computing the symmetric diagonally dominant\n projection. Numer Linear Algebr Appl 9:333\u2013345","journal-title":"Numer Linear Algebr Appl"},{"key":"143_CR46_143","unstructured":"von Neumann J (1950) Functional operators vol.\u00a0II. The geometry of orthogonal spaces. Annals of\n Mathematical Studies\u00a022, Princeton University Press. This is a\u00a0reprint of mimeographed lecture notes first distributed in 1933"}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_143","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T11:12:44Z","timestamp":1720696364000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_143"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_143","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}