{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T06:46:35Z","timestamp":1769582795250,"version":"3.49.0"},"reference-count":36,"publisher":"Informa UK Limited","issue":"5","funder":[{"DOI":"10.13039\/501100006595","name":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","doi-asserted-by":"publisher","award":["2014-2021"],"award-info":[{"award-number":["2014-2021"]}],"id":[{"id":"10.13039\/501100006595","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2022,9,3]]},"DOI":"10.1080\/10556788.2021.1998492","type":"journal-article","created":{"date-parts":[[2022,2,14]],"date-time":"2022-02-14T08:00:05Z","timestamp":1644825605000},"page":"1845-1875","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":5,"title":["Stochastic block projection algorithms with extrapolation for convex feasibility problems"],"prefix":"10.1080","volume":"37","author":[{"given":"I.","family":"Necoara","sequence":"first","affiliation":[{"name":"Automatic Control and Systems Engineering Department, University Politehnica Bucharest, Bucharest, Romania"},{"name":"Gheorghe Mihoc-Caius Iacob Institute of Mathematical Statistics and Applied Mathematics of the Romanian Academy, Bucharest, Romania"}]}],"member":"301","published-online":{"date-parts":[[2022,2,13]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1016\/S1570-579X(01)80002-1"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144593251710"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1007\/s101070050083"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-005-9010-6"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1080\/10556780310001604977"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2004.11.1073"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2006.879312"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013349430987"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-011-9401-7"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1016\/S1570-579X(01)80009-4"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2004.833493"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1007\/BF02683333"},{"key":"CIT0013","first-page":"35","volume":"142","author":"Deutsch F.","year":"2006","journal-title":"J. Approx. Theor."},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1109\/TAP.2004.836408"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(67)90113-9"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2006.11.009"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.6028\/jres.049.027"},{"key":"CIT0018","first-page":"355","volume":"35","author":"Kaczmarz S.","year":"1937","journal-title":"Bull. Int. Acad. Pol. Sci. Lett"},{"key":"CIT0019","unstructured":"A. Kundu, F. Bach, and C. Bhattacharrya, Convex optimization over intersection of simple sets: improved convergence rate guarantees via an exact penalty approach, International Conference on Artificial Intelligence and Statistics, 2018."},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1100.0456"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2005.848303"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1954-038-x"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1137\/19M1251643"},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1232-1"},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1137\/18M1167061"},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2010.5717734"},{"key":"CIT0027","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2012.12.022"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-016-0892-3"},{"issue":"198","key":"CIT0029","first-page":"1","volume":"18","author":"Patrascu A.","year":"2018","journal-title":"J. Mach. Learn. Res."},{"key":"CIT0030","doi-asserted-by":"publisher","DOI":"10.1007\/BF02612715"},{"key":"CIT0031","doi-asserted-by":"publisher","DOI":"10.1007\/s00245-019-09617-7"},{"key":"CIT0032","doi-asserted-by":"publisher","DOI":"10.1002\/mrm.20285"},{"key":"CIT0033","doi-asserted-by":"publisher","DOI":"10.1002\/1520-6378(200010)25:5<333::AID-COL4>3.0.CO;2-8"},{"key":"CIT0034","unstructured":"H. Stark and Y. Yang, Vector space projections : A numerical approach to signal and image processing, Neural Nets and Optics, Wiley-Interscience, 1998."},{"key":"CIT0035","doi-asserted-by":"publisher","DOI":"10.1142\/S1793536911000787"},{"key":"CIT0036","volume-title":"Functional Operators","author":"von Neumann J.","year":"1950"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2021.1998492","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,16]],"date-time":"2022-12-16T14:55:18Z","timestamp":1671202518000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2021.1998492"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,13]]},"references-count":36,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,9,3]]}},"alternative-id":["10.1080\/10556788.2021.1998492"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2021.1998492","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,13]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2021-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-09-20","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-02-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}