{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T04:00:51Z","timestamp":1648526451473},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,10,26]],"date-time":"2014-10-26T00:00:00Z","timestamp":1414281600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s00186-014-0480-y","type":"journal-article","created":{"date-parts":[[2014,10,25]],"date-time":"2014-10-25T20:24:32Z","timestamp":1414268672000},"page":"267-284","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem"],"prefix":"10.1007","volume":"80","author":[{"given":"Paulo Roberto","family":"Oliveira","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,26]]},"reference":[{"issue":"3","key":"480_CR1","doi-asserted-by":"crossref","first-page":"382","DOI":"10.4153\/CJM-1954-037-2","volume":"6","author":"S Agmon","year":"1954","unstructured":"Agmon S (1954) The relaxation method for linear inequalities. Can J Math 6(3):382\u2013392","journal-title":"Can J Math"},{"issue":"7","key":"480_CR2","doi-asserted-by":"crossref","first-page":"133","DOI":"10.4064\/fm-3-1-133-181","volume":"3","author":"S Banach","year":"1922","unstructured":"Banach S (1922) Sur les op\u00e9rations dans les ensembles abstraits et leur application aux \u00e9quations int\u00e9grales. Fund Math 3(7):133\u2013181","journal-title":"Fund Math"},{"key":"480_CR3","unstructured":"Barasz, M, Vempala, S (2010) A new approach to strongly polynomial linear programming. In: ICS, Proceedings, Tsinghua University Press, pp 42\u201348"},{"issue":"2","key":"480_CR4","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1287\/ijoc.2013.0569","volume":"26","author":"A Basu","year":"2014","unstructured":"Basu A, De Loera JA, Junod M (2014) On Chubanov\u2019s method for linear programming. INFORM J Comput 26(2):336\u2013350","journal-title":"INFORM J Comput"},{"key":"480_CR5","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"HH Bauschke","year":"1996","unstructured":"Bauschke HH, Borwein JM (1996) On projection algorithms for solving convex problems. SIAM Rev 38:367\u2013426","journal-title":"SIAM Rev"},{"key":"480_CR6","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1088\/0266-5611\/4\/3\/006","volume":"4","author":"Y Censor","year":"1988","unstructured":"Censor Y, Altschuler MD, Powlis WD (1988) On the use of Cimmino \u2019s simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning. Inverse Probl 4:607\u2013623","journal-title":"Inverse Probl"},{"key":"480_CR7","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1007\/s10589-011-9401-7","volume":"51","author":"Y Censor","year":"2012","unstructured":"Censor Y, Chen W, Combettes PL, Davidi R, Herman GT (2012) On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints. Comput Optim Appl 51:1065\u20131088","journal-title":"Comput Optim Appl"},{"key":"480_CR8","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0024-3795(82)90149-5","volume":"42","author":"Y Censor","year":"1982","unstructured":"Censor Y, Elfving T (1982) New methods for linear inequalities. Linear Algebra Appl 42:199\u2013211","journal-title":"Linear Algebra Appl"},{"key":"480_CR9","doi-asserted-by":"crossref","first-page":"4938","DOI":"10.1118\/1.3481566","volume":"7","author":"W Chen","year":"2010","unstructured":"Chen W, Craft D, Madden TM, Zhang K, Kooy HM, Herman GT (2010) A fast optimization algorithm for multi-criteria intensity modulated proton therapy planning. Med Phys 7:4938\u20134945","journal-title":"Med Phys"},{"key":"480_CR10","unstructured":"Cimmino G (1938) Calcolo approssimate per le soluzioni dei sistemi di equazioni lineari. La Ricerca Scientifica ed il Progresso tecnico nell\u2019Economia Nazionale, 9: 326\u2013333. Consiglio Nazionale delle Ricerche, Ministero dell\u2019Educazione Nazionale, Roma"},{"key":"480_CR11","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/5.214546","volume":"81","author":"PL Combettes","year":"1993","unstructured":"Combettes PL (1993) The foundations of set theoretic estimation. Proc IEEE 81:182\u2013208","journal-title":"Proc IEEE"},{"issue":"2","key":"480_CR12","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1007\/s10107-011-0445-3","volume":"134","author":"S Chubanov","year":"2012","unstructured":"Chubanov S (2012) A strongly polynomial algorithm for linear systems having a binary solution. Math Program 134(2):533\u2013570","journal-title":"Math Program"},{"key":"480_CR13","unstructured":"Chubanov S (2010) A polynomial relaxation-type algorithm for linear programming. http:\/\/www.optimization-online.org\/DB_FILE\/2011\/02\/2915.pdf"},{"key":"480_CR14","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1007\/BF00971652","volume":"10","author":"II Eremin","year":"1969","unstructured":"Eremin II (1969) F\u00e9jer mappings and convex programming. Sib Math J 10:762\u2013772","journal-title":"Sib Math J"},{"key":"480_CR15","first-page":"1","volume":"124","author":"J Farkas","year":"1901","unstructured":"Farkas J (1901) Theorie der einfachen Ungleichungen. J Reine Angew Math 124:1\u201327","journal-title":"J Reine Angew Math"},{"key":"480_CR16","first-page":"259","volume":"71","author":"S Filipowsky","year":"1995","unstructured":"Filipowsky S (1995) On the complexity of solving feasible systems of linear inequalities specified with approximate data. Math Program 71:259\u2013288","journal-title":"Math Program"},{"key":"480_CR17","unstructured":"Fourier JJB (1824) Reported in Analyse de travaux de l\u2019Acad\u00e9mie Royale des Sciences. Partie Math\u00e9matique, Histoire de l\u2019Acad\u00e9mie de Sciences de l\u2019Institut de France 7 (1827) xlvii\u2013lv"},{"key":"480_CR18","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF01581028","volume":"22","author":"JL Goffin","year":"1982","unstructured":"Goffin JL (1982) On the non-polynomiality of the relaxation method for a system of inequalities. Math Program 22:93\u2013103","journal-title":"Math Program"},{"issue":"3","key":"480_CR19","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1137\/S1052623493258635","volume":"6","author":"JL Goffin","year":"1996","unstructured":"Goffin JL, Luo ZQ, Ye Y (1996) Complexity analysis of an interior cutting plane method for convex feasibility problems. SIAM J Optim 6(3):638\u2013652","journal-title":"SIAM J Optim"},{"key":"480_CR20","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF01442864","volume":"6","author":"P Gordan","year":"1873","unstructured":"Gordan P (1873) Uber die auflosung linearer Gleichungen mit reelen coefficienten. Math Ann 6:23\u201328","journal-title":"Math Ann"},{"issue":"6","key":"480_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0041-5553(67)90113-9","volume":"7","author":"LG Gubin","year":"1967","unstructured":"Gubin LG, Polyak BT, Raik EV (1967) The method of projections for finding the common point of convex sets. Comput Math Math Phys 7(6):1\u201324","journal-title":"Comput Math Math Phys"},{"key":"480_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-723-7","volume-title":"Fundamentals of computerized tomography: image reconstruction from projections","author":"GT Herman","year":"2009","unstructured":"Herman GT (2009) Fundamentals of computerized tomography: image reconstruction from projections, 2nd edn. Springer, London","edition":"2"},{"key":"480_CR23","doi-asserted-by":"crossref","first-page":"1207","DOI":"10.1016\/j.laa.2006.11.009","volume":"428","author":"GT Herman","year":"2008","unstructured":"Herman GT, Chen W (2008) A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy. Linear Algebra Appl 428:1207\u20131217","journal-title":"Linear Algebra Appl"},{"key":"480_CR24","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1145\/359340.359351","volume":"21","author":"GT Herman","year":"1978","unstructured":"Herman GT, Lent A, Lutz PH (1978) Relaxation methods for image reconstruction. Commun ACM 21:152\u2013158","journal-title":"Commun ACM"},{"key":"480_CR25","first-page":"683","volume":"5","author":"Y-C Ho","year":"1965","unstructured":"Ho Y-C, Kashyap RL (1965) An algorithm for linear inequalities and its applications. IEEE Trans Electron Comput EC-14 5:683\u2013688","journal-title":"IEEE Trans Electron Comput EC-14"},{"key":"480_CR26","first-page":"207","volume-title":"Nonlinear programming","author":"P Huard","year":"1967","unstructured":"Huard P (1967) Resolution of mathematical programming with nonlinear constraints by the method of centers. In: Abadie J (ed) Nonlinear programming. North Holland Publishing Co, Amsterdam, Holland, pp 207\u2013219"},{"key":"480_CR27","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/BF02165238","volume":"8","author":"P Huard","year":"1966","unstructured":"Huard P, Lieu BT (1966) La m\u00e9thode des centres dans un espace topologique. Numer Math 8:56\u201367","journal-title":"Numer Math"},{"key":"480_CR28","unstructured":"Kantorovich LV, Akilov GP (1959) Functional Analysis in Normed Spaces. Original. translated from the Russian by Brown DE, ed by Robertson AP (1964), Pergamon Press Book, Macmillan Co, New York"},{"key":"480_CR29","unstructured":"Kaczmarz S (1937) Angenherte auflsung von systemen linearer gleschungen. B Int Acad Pol Sci Lettres Classe des Sciences Math\u00e9matiques et Naturels. S\u00e9rie A. Sciences Mathematiques, Cracovie, Imprimerie de l \u2019Universit\u00e9, pp 355\u2013357"},{"key":"480_CR30","first-page":"191","volume":"20","author":"LG Khachiyan","year":"1979","unstructured":"Khachiyan LG (1979) A polynomial algorithm in linear programming (English translation). Sov Math Doklady 20:191\u2013194","journal-title":"Sov Math Doklady"},{"key":"480_CR31","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF01582144","volume":"61","author":"LG Khachiyan","year":"1993","unstructured":"Khachiyan LG, Todd MJ (1993) On the complexity of approximating the maximal inscribed ellipsoid for a polytope. Math Program 61:137\u2013160","journal-title":"Math Program"},{"key":"480_CR32","doi-asserted-by":"crossref","first-page":"217","DOI":"10.2307\/2310345","volume":"63","author":"HW Kuhn","year":"1956","unstructured":"Kuhn HW (1956) Solvability and consistency for linear equations and inequalities. Am Math Mon 63:217\u2013232","journal-title":"Am Math Mon"},{"key":"480_CR33","first-page":"286","volume":"6","author":"A Levin","year":"1965","unstructured":"Levin A (1965) On an algorithm for the minimization of convex functions. Sov Math Doklady 6:286\u2013290","journal-title":"Sov Math Doklady"},{"key":"480_CR34","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1016\/0041-5553(63)90463-4","volume":"2","author":"YI Merzlyakov","year":"1963","unstructured":"Merzlyakov YI (1963) On a relaxation method of solving systems of linear inequalities. USSR Comput Math Math Phys 2:504\u2013510","journal-title":"USSR Comput Math Math Phys"},{"key":"480_CR35","unstructured":"Motzkin TS (1936) Beitrage zur theorie der linearen ungleichungen. Section 13, Azriel, Jerusalem"},{"key":"480_CR36","doi-asserted-by":"crossref","first-page":"393","DOI":"10.4153\/CJM-1954-038-x","volume":"6","author":"TS Motzkin","year":"1954","unstructured":"Motzkin TS, Schoenberg IJ (1954) The relaxation method for linear inequalities. Can J Math 6:393\u2013404","journal-title":"Can J Math"},{"key":"480_CR37","volume-title":"Problem complexity and method efficiency in optimization","author":"A Nemirovsky","year":"1983","unstructured":"Nemirovsky A, Yudin D (1983) Problem complexity and method efficiency in optimization. Wiley-Interscience Series in Discrete Mathematics, New York"},{"key":"480_CR38","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1145\/321281.321291","volume":"12","author":"DJ Newman","year":"1965","unstructured":"Newman DJ (1965) Location of the maximum on unimodal surfaces. J Assoc Comput Math 12:395\u2013398","journal-title":"J Assoc Comput Math"},{"key":"480_CR39","volume-title":"Introduction to optimization","author":"BT Polyak","year":"1987","unstructured":"Polyak BT (1987) Introduction to optimization. Optimization Software Inc, New York"},{"key":"480_CR40","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-82118-9","volume-title":"Minimization methods for non-differentiable functions","author":"NZ Shor","year":"1985","unstructured":"Shor NZ (1985) Minimization methods for non-differentiable functions. Springer, Berlin Springer Series Computational Mathematics, 3"},{"key":"480_CR41","first-page":"226","volume":"37","author":"SP Tarasov","year":"1988","unstructured":"Tarasov SP, Khachiyan LG, Erlikh I (1988) The method of inscribed ellipsoids. Sov Math Doklady 37:226\u2013230","journal-title":"Sov Math Doklady"},{"key":"480_CR42","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"E Tardos","year":"1986","unstructured":"Tardos E (1986) A strongly polynomial algorithm to solve combinatorial linear programs. Oper Res 34:250\u2013256","journal-title":"Oper Res"},{"key":"480_CR43","unstructured":"Todd MJ (1979) Some remarks on the relaxation method for linear inequalities, Technical report 419. School of Operations Research and Industrial Engineering,Cornell University, Ithaca, NY"},{"key":"480_CR44","first-page":"291","volume":"73","author":"PM Vaidya","year":"1996","unstructured":"Vaidya PM (1996) A new algorithm for minimizing a convex function over convex sets. Math Program 73:291\u2013341","journal-title":"Math Program"},{"issue":"1","key":"480_CR45","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF02592148","volume":"74","author":"SA Vavasis","year":"1996","unstructured":"Vavasis SA, Ye Y (1996) A primal-dual interior point method whose running time depends only on the constraint matrix. Math Program 74(1):79\u2013120","journal-title":"Math Program"},{"key":"480_CR46","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1006\/jcom.1996.0029","volume":"12","author":"Y Ye","year":"1986","unstructured":"Ye Y (1986) How partial knowledge helps to solve linear programs. J Complex 12:480\u2013491","journal-title":"J Complex"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-014-0480-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-014-0480-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-014-0480-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,16]],"date-time":"2019-08-16T17:08:34Z","timestamp":1565975314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-014-0480-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,26]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["480"],"URL":"https:\/\/doi.org\/10.1007\/s00186-014-0480-y","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,26]]}}}