{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T10:48:30Z","timestamp":1758278910508},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"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":[[1994,3]]},"DOI":"10.1007\/bf01582569","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:39:29Z","timestamp":1114677569000},"page":"149-171","source":"Crossref","is-referenced-by-count":15,"title":["A row-action method for convex programming"],"prefix":"10.1007","volume":"64","author":[{"given":"Alfredo N.","family":"Iusem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B. F.","family":"Svaiter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"L.M. Bregman","year":"1967","unstructured":"L.M. Bregman, \u201cThe relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming,\u201dUSSR Computational Mathematics and Mathematical Physics 7 (1967) 200\u2013217.","journal-title":"USSR Computational Mathematics and Mathematical Physics"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1137\/1023097","volume":"23","author":"Y. Censor","year":"1981","unstructured":"Y. Censor, \u201cRow-action methods for huge and sparse systems and its applications,\u201dSIAM Review 23 (1981) 444\u2013464.","journal-title":"SIAM Review"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01585107","volume":"24","author":"Y. Censor","year":"1982","unstructured":"Y. Censor and A. Lent, \u201cCyclic subgradient projections,\u201dMathematical Programming 24 (1982) 233\u2013235.","journal-title":"Mathematical Programming"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF00940283","volume":"51","author":"A. Pierro De","year":"1986","unstructured":"A. De Pierro and A. Iusem, \u201cA relaxed version of Bregman's method for convex programming,\u201dJournal of Optimization Theory and Applications 51 (1986) 421\u2013440.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF01448368","volume":"17","author":"A. Pierro De","year":"1988","unstructured":"A. De Pierro and A. Iusem, \u201cA finitely convergent \u201crow-action\u201d method for the convex feasibility problem,\u201dApplied Mathematics and Optimization 17 (1988) 225\u2013235.","journal-title":"Applied Mathematics and Optimization"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01580719","volume":"40","author":"S.P. Han","year":"1988","unstructured":"S.P. Han, \u201cA successive projections method,\u201dMathematical Programming 40 (1988) 1\u201314.","journal-title":"Mathematical Programming"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1137\/0326019","volume":"26","author":"S.P. Han","year":"1988","unstructured":"S.P. Han and G. Lou, \u201cA parallel algorithm for a class of convex programs,\u201dSIAM Journal on Control and Optimization 26 (1988) 345\u2013355.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"CR8","unstructured":"Y. Haugazeau, \u201cSur la minimization des formes quadratiques avec constraintes,\u201dComptes Rendus de l'Acad\u00e9mie des Sciences de Paris A-264 (1967) 322\u2014324."},{"key":"CR9","volume-title":"Image Reconstruction from Projections, the Fundamentals of Computerized Tomography","author":"G. Herman","year":"1980","unstructured":"G. Herman,Image Reconstruction from Projections, the Fundamentals of Computerized Tomography (Academic Press, New York, 1980)."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/nav.3800040113","volume":"4","author":"C. Hildreth","year":"1957","unstructured":"C. Hildreth, \u201cA quadratic programming procedure,\u201dNaval Research Logistics Quarterly 4 (1957) 79\u201385.","journal-title":"Naval Research Logistics Quarterly"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1137\/0801025","volume":"1","author":"A. Iusem","year":"1991","unstructured":"A. Iusem, \u201cOn dual convergence and the rate of primal convergence of Bregman's convex programming method,\u201dSIAM Journal on Optimization 1 (1991) 401\u2013423.","journal-title":"SIAM Journal on Optimization"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1137\/0325014","volume":"25","author":"A. Iusem","year":"1987","unstructured":"A. Iusem and A. De Pierro, \u201cA simultaneous iterative method for computing projections on polyhedra,\u201dSIAM Journal on Control and Optimization 25 (1987) 231\u2013243.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF01580851","volume":"47","author":"A. Iusem","year":"1990","unstructured":"A. Iusem and A. De Pierro, \u201cOn the convergence properties of Hildreth's quadratic programming algorithm,\u201dMathematical Programming 47 (1990) 37\u201351.","journal-title":"Mathematical Programming"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01582891","volume":"52","author":"A. Iusem","year":"1991","unstructured":"A. Iusem and A. De Pierro, \u201cOn the convergence of Han's method for convex programming with quadratic objective,\u201dMathematical Programming 52 (1991) 265\u2013284.","journal-title":"Mathematical Programming"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1137\/0318033","volume":"18","author":"A. Lent","year":"1980","unstructured":"A. Lent and Y. Censor, \u201cExtensions of Hildreth's row-action method for convex programming,\u201dSIAM Journal on Control and Optimization 18 (1980) 444\u2013454.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/BF02591886","volume":"30","author":"J. Mandel","year":"1984","unstructured":"J. Mandel, \u201cConvergence of the cyclical relaxation method for linear inequalities,\u201dMathematical Programming 30 (1984) 218\u2013228.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582569.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582569\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582569","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:15:51Z","timestamp":1556896551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582569"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["BF01582569"],"URL":"https:\/\/doi.org\/10.1007\/bf01582569","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}