{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:22Z","timestamp":1761611062835},"reference-count":37,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0167-6377(98)00003-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:29:21Z","timestamp":1027610961000},"page":"97-103","source":"Crossref","is-referenced-by-count":15,"title":["A superlinearly convergent projection algorithm for solving the convex inequality problem"],"prefix":"10.1016","volume":"22","author":[{"given":"Ubaldo M.","family":"Garc\u0131\u0301a-Palomares","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(98)00003-0_BIB1","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF02612339","article-title":"Newton\u2019s method for linear complementarity problem","volume":"28","author":"Aganagi\u0107","year":"1984","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(98)00003-0_BIB2","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/0196-8858(83)90019-2","article-title":"An interior points algorithm for the convex feasibility problem","volume":"4","author":"Aharoni","year":"1983","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/S0167-6377(98)00003-0_BIB3","doi-asserted-by":"crossref","unstructured":"H.H. Bauschke, J.M. Borwein, On projection algorithms for solving convex feasibility problems, SIAM Review 38 (1996) 367\u2013426.","DOI":"10.1137\/S0036144593251710"},{"key":"10.1016\/S0167-6377(98)00003-0_BIB4","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1137\/0913010","article-title":"Row projection methods for large nonsymmetric linear systems","volume":"13","author":"Bramley","year":"1992","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/S0167-6377(98)00003-0_BIB5","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1080\/00207169008803865","article-title":"On the behaviour of a block iterative projection method for solving convex feasibility problems","volume":"34","author":"Butnariu","year":"1990","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/S0167-6377(98)00003-0_BIB6","doi-asserted-by":"crossref","unstructured":"A. Cegielski, Projection onto an acute cone and convex feasibility problem, in: 16th IFIP Conf. on System Modelling and Optimization, 1993.","DOI":"10.1007\/BFb0035467"},{"key":"10.1016\/S0167-6377(98)00003-0_BIB7","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01585107","article-title":"Cyclic subgradient projections","volume":"24","author":"Censor","year":"1982","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(98)00003-0_BIB8","doi-asserted-by":"crossref","unstructured":"F. Deutsch, The method of alternating projections, in: S.P. Singh (Ed.) Theory, Spline Functions and Applications, Kluwer Academic Publishers, Dordrecht, pp. 105\u2013121, 1992.","DOI":"10.1007\/978-94-011-2634-2_5"},{"key":"10.1016\/S0167-6377(98)00003-0_BIB9","first-page":"219","article-title":"The relaxation method of solving systems of inequalities with convex functions on the left sides","volume":"6","author":"Eremin","year":"1965","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/S0167-6377(98)00003-0_BIB10","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF02017349","article-title":"Relaxed outer projections, weighted averages and convex feasibility","volume":"30","author":"Fl\u00e5m","year":"1990","journal-title":"BIT"},{"key":"10.1016\/S0167-6377(98)00003-0_BIB11","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/nav.3800030109","article-title":"An algorithm for quadratic programming","volume":"3","author":"Frank","year":"1956","journal-title":"Naval. Res. Logist. Quart."},{"key":"10.1016\/S0167-6377(98)00003-0_BIB12","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/BF01584250","article-title":"A global and quadratic algorithm for solving a system of mixed equalities and inequalities","volume":"21","author":"Garc\u0131\u0301a-Palomares","year":"1981","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(98)00003-0_BIB13","unstructured":"U.M. Garc\u0131\u0301a-Palomares, Q-relaxation method for solving a system of linear inequalities, in: Tech. Memo ANL\/MCS-TM-19, Argonne National Laboratory, IL, USA, 1983."},{"key":"10.1016\/S0167-6377(98)00003-0_BIB14","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0167-6377(90)90017-Y","article-title":"A class of methods for solving large convex systems","volume":"9","author":"Garc\u0131\u0301a-Palomares","year":"1990","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(98)00003-0_BIB15","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1137\/0803046","article-title":"Parallel projected aggregation methods for solving the convex feasibility problem","volume":"3","author":"Garc\u0131\u0301a-Palomares","year":"1993","journal-title":"SIAM J. Optim."},{"key":"10.1016\/S0167-6377(98)00003-0_BIB16","unstructured":"U.M. Garc\u0131\u0301a-Palomares, Aplicaci\u00f3n de los m\u00e9todos de proyecci\u00f3n en el problema de factibilidad convexa: Un Repaso Investigaci\u00f3n Operativa 4-3 (1994) 229\u2013245."},{"key":"10.1016\/S0167-6377(98)00003-0_BIB17","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1080\/10556789508805607","article-title":"A finite procedure for finding a point satisfying a system of inequalities","volume":"5","author":"Garc\u0131\u0301a-Palomares","year":"1995","journal-title":"Opt. Meth. Software"},{"key":"10.1016\/S0167-6377(98)00003-0_BIB18","unstructured":"U.M. Garc\u0131\u0301a-Palomares, Acceleration technique for solving convex (linear) systems via projection methods, in: Reporte de investigaci\u00f3n OP140696, Departamento de Tecnolog\u0131\u0301a de las Comunicaciones, Universidad de Vigo, Espa\u00f1a, 1996."},{"key":"10.1016\/S0167-6377(98)00003-0_BIB19","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0377-0427(89)90296-3","article-title":"Acceleration schemes for the method of alternating projections","volume":"26","author":"Gearhart","year":"1989","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/S0167-6377(98)00003-0_BIB20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0041-5553(67)90113-9","article-title":"The method of projections for finding the common point of convex sets","volume":"7","author":"Gubin","year":"1967","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"10.1016\/S0167-6377(98)00003-0_BIB21","unstructured":"P.T. Harker, J.S. Pang, A damped newton method for the linear complementarity problem, Lectures in Applied Mathematics, vol. 26, American Mathematical Society, Providence, RI, 1990, pp. 265\u2013284."},{"key":"10.1016\/S0167-6377(98)00003-0_BIB22","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF01386209","article-title":"On certain iterative methods for solving linear systems","volume":"2","author":"Householder","year":"1960","journal-title":"Numer. Math."},{"key":"10.1016\/S0167-6377(98)00003-0_BIB23","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01389537","article-title":"Convergence results for an accelerated nonlinear cimmino algorithm","volume":"49","author":"Iusem","year":"1986","journal-title":"Numer. Math."},{"key":"10.1016\/S0167-6377(98)00003-0_BIB24","doi-asserted-by":"crossref","unstructured":"K.C. Kiwiel, Block-Iterative surrogate projection methods for convex feasibility problems, Linear Algebra Appl. pp. 225\u2013259, 1995.","DOI":"10.1016\/0024-3795(93)00089-I"},{"key":"10.1016\/S0167-6377(98)00003-0_BIB25","unstructured":"M. Kojima, N. Megiddo, Y. Ye, An interior point potential reduction algorithm for the linear complementarity problem, Report RJ 6486, IBM Almaden Research Center, 1988."},{"key":"10.1016\/S0167-6377(98)00003-0_BIB26","unstructured":"O.L. Mangasarian, Nonlinear Programming, McGraw-Hill, New York 1969."},{"key":"10.1016\/S0167-6377(98)00003-0_BIB27","unstructured":"J. Von Neuman, Functional Operators, vol. 2, Princeton University Press, Princeton, NJ 1950."},{"key":"10.1016\/S0167-6377(98)00003-0_BIB28","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01580617","article-title":"NE\/SQP: a robust algorithm for the nonlinear complementarity problem","volume":"60","author":"Pang","year":"1993","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(98)00003-0_BIB29","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0041-5553(64)90079-5","article-title":"Gradient methods for solving equations and inequalities","volume":"6","author":"Polyak","year":"1964","journal-title":"U.S.S.R Comput. Math. Math. Phys."},{"key":"10.1016\/S0167-6377(98)00003-0_BIB30","unstructured":"J.C. Pons, Resoluci\u00f3n del Problema de Programaci\u00f3n Cuadr\u00e1tica Utilizando el M\u00e9todo de Proyecciones, Trabajo de grado, Maestr\u0131\u0301a de Ingenier\u0131\u0301a de Sistemas, Universidad Sim\u00f3n Bol\u0131\u0301var, 1996."},{"key":"10.1016\/S0167-6377(98)00003-0_BIB31","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1007\/BF01146940","article-title":"Newton\u2019s method for the solution of equalities and inequalities","volume":"8","author":"Pshenichnyi","year":"1970","journal-title":"Math. Notes Acad. Sci."},{"key":"10.1016\/S0167-6377(98)00003-0_BIB32","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01404880","article-title":"Extension of Newton\u2019s method to nonlinear functions with values in a cone","volume":"19","author":"Robinson","year":"1972","journal-title":"Numer. Math."},{"key":"10.1016\/S0167-6377(98)00003-0_BIB33","doi-asserted-by":"crossref","unstructured":"S.M. Robinson, A sub-gradient, algorithm for solving K-convex systems, Lectures Notes in Econ. and Math. Syst., Vol. 117, Springer, Berlin, 1976, pp. 237\u2013245.","DOI":"10.1007\/978-3-642-46329-7_21"},{"key":"10.1016\/S0167-6377(98)00003-0_BIB34","unstructured":"R.T. Rockafellar, Convex Analysis, Princeton University Press, Princeton, Second Printing, 1972."},{"key":"10.1016\/S0167-6377(98)00003-0_BIB35","unstructured":"C. Vega, Resoluci\u00f3n del Modelo de Programaci\u00f3n Lineal Mediante la Metodolog\u0131\u0301a de Agregaci\u00f3n de Proyecciones, Trabajo de grado, maestr\u0131\u0301a de Ingenier\u0131\u0301a de Sistemas, Universidad Sim\u00f3n Bol\u0131\u0301var, 1995."},{"key":"10.1016\/S0167-6377(98)00003-0_BIB36","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF00939954","article-title":"New iterative methods for linear inequalities","volume":"72","author":"Yang","year":"1992","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0167-6377(98)00003-0_BIB37","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1137\/0803019","article-title":"On the superlinear convergence of interior-point algorithms for a general class of problems","volume":"3","author":"Zhang","year":"1993","journal-title":"SIAM J. Optim."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000030?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000030?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T11:18:34Z","timestamp":1578655114000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637798000030"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":37,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0167637798000030"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(98)00003-0","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}