{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T19:48:06Z","timestamp":1760384886810},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,7,5]],"date-time":"2008-07-05T00:00:00Z","timestamp":1215216000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1007\/s11075-008-9218-3","type":"journal-article","created":{"date-parts":[[2008,7,4]],"date-time":"2008-07-04T14:18:44Z","timestamp":1215181124000},"page":"97-114","source":"Crossref","is-referenced-by-count":10,"title":["A hybrid algorithm for solving linear inequalities in a least squares sense"],"prefix":"10.1007","volume":"50","author":[{"given":"Achiya","family":"Dax","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,7,5]]},"reference":[{"key":"9218_CR1","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1080\/10556789208805504","volume":"1","author":"K.P. Bennet","year":"1992","unstructured":"Bennet, K.P., Mangasarian, O.L.: Robust linear programming discrimination of two linearly inseparable sets. Optimiz. Methods Softw. 1, 23\u201334 (1992)","journal-title":"Optimiz. Methods Softw."},{"key":"9218_CR2","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971484","volume-title":"Numerical Methods for Least Squares Problems","author":"A. Bjorck","year":"1996","unstructured":"Bjorck, A.: Numerical Methods for Least Squares Problems. SIAM, Philadelphia (1996)"},{"key":"9218_CR3","doi-asserted-by":"crossref","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511804441"},{"key":"9218_CR4","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1137\/0917020","volume":"17","author":"R. Bramley","year":"1996","unstructured":"Bramley, R., Winnicka, B.: Solving linear inequalities in a least squares sense. SIAM J. Sci. Comput. 17, 275\u2013286 (1996)","journal-title":"SIAM J. Sci. Comput."},{"key":"9218_CR5","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0096-3003(88)90064-1","volume":"25","author":"Y. Censor","year":"1988","unstructured":"Censor, Y., Altschuler, M.D., Powlis, W.D.: A computational solution of the inverse problem in radiation-therapy treatment planning. Appl. Math. Comput. 25, 57\u201387 (1988)","journal-title":"Appl. Math. Comput."},{"key":"9218_CR6","doi-asserted-by":"crossref","first-page":"1406","DOI":"10.1016\/j.laa.2007.11.001","volume":"428","author":"Y. Censor","year":"2008","unstructured":"Censor, Y., Ben-Israel, A., Xiao, Y., Galvin, J.M.: On linear infeasibility arising in intensity-modulated radiation therapy inverse planning. Linear Algebra Appl. 428, 1406\u20131420 (2008)","journal-title":"Linear Algebra Appl."},{"key":"9218_CR7","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.: New methods for linear inequalities. Linear Algebra Appl. 42, 199\u2013211 (1982)","journal-title":"Linear Algebra Appl."},{"key":"9218_CR8","volume-title":"Parallel Optimization, Theory Algorithms, and Applications","author":"Y. Censor","year":"1997","unstructured":"Censor, Y., Zenios, S.A.: Parallel Optimization, Theory Algorithms, and Applications. Oxford University Press, Oxford (1997)"},{"key":"9218_CR9","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/ijoc.9.2.164","volume":"9","author":"J.W. Chinneck","year":"1997","unstructured":"Chinneck, J.W.: Finding a useful subset of constraints for analysis in an infeasible linear progarm. INFORMS J. Comput. 9, 164\u2013174 (1997)","journal-title":"INFORMS J. Comput."},{"key":"9218_CR10","unstructured":"Chinneck, J.W.L: Feasibility and infeasibility in optimization: algorithms and computational methods. In: International Series in Operations Research and Management Sciences, vol.\u00a0118. Springer-Verlag (2007)"},{"key":"9218_CR11","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1287\/ijoc.3.2.157","volume":"3","author":"J.W. Chinneck","year":"1991","unstructured":"Chinneck, J.W., Dravnieks, E.W.: Locating minimal infeasible constraint sets in linear programs. ORSA J. Comput. 3, 157\u2013168 (1991)","journal-title":"ORSA J. Comput."},{"key":"9218_CR12","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1093\/imanum\/8.1.23","volume":"8","author":"D.I. Clark","year":"1988","unstructured":"Clark, D.I., Osborne, M.R.: On linear restricted and interval least-squares problems. IMA J. Numer. Anal. 8, 23\u201336 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"9218_CR13","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0803014","volume":"3","author":"T. Coleman","year":"1993","unstructured":"Coleman, T., Hulbert, L.: A globally and superlinearly convergent algorithm for quadratic programming with simple bounds. SIAM J. Optim. 3, 298\u2013321 (1993)","journal-title":"SIAM J. Optim."},{"key":"9218_CR14","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1137\/1032122","volume":"32","author":"A. Dax","year":"1990","unstructured":"Dax, A.: The convergence of linear stationary iterative processes for solving singular unstructured systems of linear equations. SIAM Rev. 32, 611\u2013635 (1990)","journal-title":"SIAM Rev."},{"key":"9218_CR15","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1016\/0024-3795(91)90404-K","volume":"156","author":"A. Dax","year":"1991","unstructured":"Dax, A.: A row relaxation method for large \u21131 problems. Linear Algebra Appl. 156, 793\u2013818 (1991)","journal-title":"Linear Algebra Appl."},{"key":"9218_CR16","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1145\/103147.103155","volume":"17","author":"A. Dax","year":"1991","unstructured":"Dax, A.: On computational aspects of bounded linear least squares problems. ACM Trans. Math. Softw. 17, 64\u201373 (1991)","journal-title":"ACM Trans. Math. Softw."},{"key":"9218_CR17","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1023\/A:1015370617219","volume":"2","author":"A. Dax","year":"2001","unstructured":"Dax, A.: The smallest correction of an inconsistent system of linear inequalities. Optimiz. Eng. 2, 349\u2013359 (2001)","journal-title":"Optimiz. Eng."},{"key":"9218_CR18","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0024-3795(01)00600-0","volume":"361","author":"A. Dax","year":"2003","unstructured":"Dax, A.: The adventures of a simple algorithm. Linear Algebra Appl. 361, 41\u201361 (2003)","journal-title":"Linear Algebra Appl."},{"key":"9218_CR19","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1023\/B:BITN.0000014544.99142.62","volume":"43","author":"A. Dax","year":"2003","unstructured":"Dax, A.: An open question on cyclic relaxation. BIT Numer. Math. 43, 929\u2013943 (2003)","journal-title":"BIT Numer. Math."},{"key":"9218_CR20","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.csda.2004.07.007","volume":"50","author":"A. Dax","year":"2006","unstructured":"Dax, A.: The \u21131 solution of linear inequalities. Comput. Statist. Data Anal. 50, 40\u201360 (2006)","journal-title":"Comput. Statist. Data Anal."},{"key":"9218_CR21","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/j.laa.2006.03.022","volume":"416","author":"A. Dax","year":"2006","unstructured":"Dax, A.: The distance between two convex sets. Linear Algebra Appl. 416, 184\u2013213 (2006)","journal-title":"Linear Algebra Appl."},{"key":"9218_CR22","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/978-3-642-46631-1_11","volume-title":"Optimization, Parallel Processing and Applications. Lecture Notes in Ecomomics and Mathematical Systems, vol.\u00a0304","author":"R. Leone De","year":"1988","unstructured":"De Leone, R., Mangasarian, O.L.: Serial and parallel solution of large scale linear programs by augmented Lagrangian successive overrelaxation. In: Kurzhanski, A., Neuwmann, K., Pallaschke, D. (eds.) Optimization, Parallel Processing and Applications. Lecture Notes in Ecomomics and Mathematical Systems, vol.\u00a0304, pp.\u00a0103\u2013124. Springer, Berlin (1988)"},{"key":"9218_CR23","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971200","volume-title":"Numerical Methods for Unconstrained Optimization and Nonlinear Equations","author":"J.E. Dennis","year":"1996","unstructured":"Dennis, J.E., Schnabel, R.B.: Numerical Methods for Unconstrained Optimization and Nonlinear Equations. SIAM, Philadelphia (1996)"},{"key":"9218_CR24","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0024-3795(85)90280-0","volume":"64","author":"A.R. Pierro De","year":"1985","unstructured":"De Pierro, A.R., Iusem, A.N.: A simultaneous projection method for linear inequalities. Linear Algebra Appl. 64, 243\u2013253 (1985)","journal-title":"Linear Algebra Appl."},{"key":"9218_CR25","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/BF01932285","volume":"17","author":"L. Eld\u00e9n","year":"1977","unstructured":"Eld\u00e9n, L.: Algorithms for the regularization of ill-conditioned least squares problems. BIT 17, 134\u2013145 (1977)","journal-title":"BIT"},{"key":"9218_CR26","unstructured":"Fletcher, R.: Practical Methods of Optimization. Wiley (1980)"},{"key":"9218_CR27","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1093\/imamat\/14.2.159","volume":"14","author":"R. Fletcher","year":"1974","unstructured":"Fletcher, R., Jackson, M.P.: Minimization of a quadratic function of many variables subject only to lower and upper bounds. J. Inst. Math. Appl. 14, 159\u2013174 (1974)","journal-title":"J. Inst. Math. Appl."},{"key":"9218_CR28","volume-title":"Practical Optimization","author":"P.E. Gill","year":"1981","unstructured":"Gill, P.E., Murray, W., Wright, M.H.: Practical Optimization. Academic Press, London (1981)"},{"key":"9218_CR29","unstructured":"Gill, P.E., Murray, W., Wright, M.H.: Numerical Linear Algebra and Optimization. Addison-Wesley (1991)"},{"key":"9218_CR30","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations. Johns Hopkins University Press (1983)"},{"key":"9218_CR31","unstructured":"Han, S.P.: Least-squares solution of linear inequalities. Technical Report 2141, Math. Res. Center, University of Wisconsin-Madison (1980)"},{"key":"9218_CR32","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719697","volume-title":"Rank-Deficient and Discrete Ill-Posed Problems","author":"P.C. Hansen","year":"1998","unstructured":"Hansen, P.C.: Rank-Deficient and Discrete Ill-Posed Problems. SIAM, Philadelphia (1998)"},{"key":"9218_CR33","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1137\/0907055","volume":"7","author":"R.J. Hanson","year":"1986","unstructured":"Hanson, R.J.: Linear least squares with bounds and linear constraints. SIAM J. Sci. Statist. Comput. 7, 826\u2013834 (1986)","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"9218_CR34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01580425","volume":"8","author":"G.T. Herman","year":"1975","unstructured":"Herman, G.T.: A relaxation method for reconstructing object from noisy x-rays. Math. Progr. 8, 1\u201319 (1975)","journal-title":"Math. Progr."},{"key":"9218_CR35","volume-title":"Image Reconstruction from Projections: The Fundamentals of Computerized Tomography","author":"G.T. Herman","year":"1982","unstructured":"Herman, G.T.: Image Reconstruction from Projections: The Fundamentals of Computerized Tomography. Academic Press, New York, USA (1982)"},{"key":"9218_CR36","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BFb0120823","volume":"9","author":"G.T. Herman","year":"1978","unstructured":"Herman, G.T., Lent, A.: A family of iterative quadratic optimization algorithms for pairs of inequalities, with applications in diagnostic radiology. Math. Progr. Study 9, 15\u201329 (1978)","journal-title":"Math. Progr. Study"},{"key":"9218_CR37","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1137\/0325014","volume":"25","author":"A.N. Iusem","year":"1987","unstructured":"Iusem, A.N., De Pierro, A.R.: A simultaneous iterative method for computing projections on polyhedra. SIAM J. Control 25, 231\u2013243 (1987)","journal-title":"SIAM J. Control"},{"key":"9218_CR38","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1137\/0318033","volume":"18","author":"A. Lent","year":"1980","unstructured":"Lent, A., Censor, Y.: Extensions of Hildreth\u2019s row-action method for quadratic programming. SIAM J. Control Optim. 18, 444\u2013454 (1980)","journal-title":"SIAM J. Control Optim."},{"key":"9218_CR39","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s101070050049","volume":"85","author":"K. Madsen","year":"1999","unstructured":"Madsen, K., Nielsen, H.B., Pinar, M.C.: Bound constrained quadratic programming via piecewise quadratic functions. Math. Prog. 85, 135\u2013156 (1999)","journal-title":"Math. Prog."},{"key":"9218_CR40","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1137\/S1052623495297820","volume":"9","author":"K. Madsen","year":"1999","unstructured":"Madsen, K., Nielsen, H.B., Pinar, M.C.: A finite continuation algorithm for bound constrained quadratic programming. SIAM J. Optim. 9, 62\u201383 (1999)","journal-title":"SIAM J. Optim."},{"key":"9218_CR41","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1287\/opre.13.3.444","volume":"13","author":"O.L. Mangasarian","year":"1965","unstructured":"Mangasarian, O.L.: Linear and nonlinear separation of patterns by linear programming. Oper. Res. 13, 444\u2013452 (1965)","journal-title":"Oper. Res."},{"key":"9218_CR42","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1137\/0718039","volume":"18","author":"O.L. Mangasarian","year":"1981","unstructured":"Mangasarian, O.L.: Iterative solution of linear programs. SIAM J. Numer. Anal. 18, 606\u2013614 (1981)","journal-title":"SIAM J. Numer. Anal."},{"key":"9218_CR43","volume-title":"Nonlinear Optimization and Applications","author":"O.L. Mangasarian","year":"1996","unstructured":"Mangasarian, O.L.: Mathematical programming in machine learning. In: Di Pillo, G., Giannesi, F. (eds.) Nonlinear Optimization and Applications. Plenum Press, New York (1996)"},{"key":"9218_CR44","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0167-6377(98)00049-2","volume":"24","author":"O.L. Mangasarian","year":"1999","unstructured":"Mangasarian, O.L.: Arbitrary-norm separating plane. Oper. Res. Lett. 24, 15\u201323 (1999)","journal-title":"Oper. Res. Lett."},{"key":"9218_CR45","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02186473","volume":"14","author":"O.L. Mangasarian","year":"1988","unstructured":"Mangasarian, O.L., De Leone, R.: Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs. Ann. Oper. Res. 14, 41\u201359 (1988)","journal-title":"Ann. Oper. Res."},{"key":"9218_CR46","first-page":"22","volume-title":"Large-scale Numerical Optimizations","author":"O.L. Mangasarian","year":"1990","unstructured":"Mangasarian, O.L., Setiono, R., Wolberg, W.H.: Pattern recognition via linear programming: theory and application to medical diagnosis. In: Coleman, T.F., Li, Y. (eds.) Large-scale Numerical Optimizations, pp.\u00a022\u201331. SIAM, Philadelphia (1990)"},{"key":"9218_CR47","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF01396045","volume":"55","author":"J.J. Mor\u00e9","year":"1989","unstructured":"Mor\u00e9, J.J., Toraldo, G.: Algorithms for bound constrained quadratic programming problems. Numer. Math. 55, 377\u2013400 (1989)","journal-title":"Numer. Math."},{"key":"9218_CR48","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1016\/S0377-2217(97)00178-1","volume":"107","author":"M.C. Pinar","year":"1998","unstructured":"Pinar, M.C.: Newton\u2019s method for linear inequality systems. Eur. J. Oper. Res. 107, 710\u2013719 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"9218_CR49","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971408","volume-title":"Matrix Algorithms, Volume 1: Basic Decompositions","author":"G.W. Stewart","year":"1998","unstructured":"Stewart, G.W.: Matrix Algorithms, Volume 1: Basic Decompositions. SIAM, Philadelphia (1998)"},{"key":"9218_CR50","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1017\/S0962492900002853","volume":"7","author":"G.A. Watson","year":"1998","unstructured":"Watson, G.A.: Choice of norms for data fitting and function approximation. Acta. Numer. 7, 337\u2013377 (1998)","journal-title":"Acta. Numer."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-008-9218-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-008-9218-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-008-9218-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T03:02:33Z","timestamp":1709089353000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-008-9218-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,5]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["9218"],"URL":"https:\/\/doi.org\/10.1007\/s11075-008-9218-3","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,5]]}}}