{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T19:57:30Z","timestamp":1770839850430,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"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,8]]},"DOI":"10.1007\/bf01581141","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:41:12Z","timestamp":1114681272000},"page":"137-144","source":"Crossref","is-referenced-by-count":135,"title":["A new method for a class of linear variational inequalities"],"prefix":"10.1007","volume":"66","author":[{"given":"Bingsheng","family":"He","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"890","DOI":"10.1090\/S0002-9904-1975-13874-2","volume":"81","author":"R.E. Bruck","year":"1975","unstructured":"R.E. Bruck, \u201cAn iterative solution of a variational inequality for certain monotone operators in Hilbert space,\u201dBulletin of the American Mathematical Society 81 (1975) 890\u2013892.","journal-title":"Bulletin of the American Mathematical Society"},{"key":"CR2","volume-title":"Introduction to Matrix Numerical Analysis and Optimization, Collection of Applied Mathematics for the Master's Degree","author":"P.G. Ciarlet","year":"1982","unstructured":"P.G. Ciarlet,Introduction to Matrix Numerical Analysis and Optimization, Collection of Applied Mathematics for the Master's Degree (Masson, Paris, 1982)."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0024-3795(68)90052-9","volume":"1","author":"R.W. Cottle","year":"1968","unstructured":"R.W. Cottle and G.B. Dantzig, \u201cComplementary pivot theory of mathematical programming,\u201dLinear Algebra and Its Applications 1 (1968) 103\u2013125.","journal-title":"Linear Algebra and Its Applications"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/BF02591891","volume":"26","author":"S. Dafermos","year":"1983","unstructured":"S. Dafermos, \u201cAn iterative scheme for variational inequalities,\u201dMathematical Programming 26 (1983) 40\u201347.","journal-title":"Mathematical Programming"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"1225","DOI":"10.1109\/TAC.1980.1102537","volume":"25","author":"S.C. Fang","year":"1980","unstructured":"S.C. Fang, \u201cAn iterative method for generalized complementarity problems,\u201dIEEE Transactions on Automatic Control AC 25 (1980) 1225\u20131227.","journal-title":"IEEE Transactions on Automatic Control AC"},{"key":"CR6","first-page":"265","volume":"26","author":"P.T. Harker","year":"1990","unstructured":"P.T. Harker and J.S. Pang, \u201cA damped-Newton method for the linear complementarity problem,\u201dLectures in Applied Mathematics 26 (1990) 265\u2013284.","journal-title":"Lectures in Applied Mathematics"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF01182323","volume":"25","author":"B.S. He","year":"1992","unstructured":"B.S. He \u201cA projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming,\u201dApplied Mathematics and Optimization 25 (1992) 247\u2013262.","journal-title":"Applied Mathematics and Optimization"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01587074","volume":"44","author":"M. Kojima","year":"1989","unstructured":"M. Kojima, S. Mizuno and A. Yoshise, \u201cA polynomial-time algorithm for a class of linear complementarity problems,\u201dMathematical Programming 44 (1989) 1\u201326.","journal-title":"Mathematical Programming"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1287\/mnsc.11.7.681","volume":"11","author":"C.E. Lemke","year":"1965","unstructured":"C.E. Lemke, \u201cBimatrix equilibrium points and mathematical programming,\u201dManagement Science 11 (1965) 681\u2013689.","journal-title":"Management Science"},{"key":"CR10","first-page":"45","volume":"12","author":"C.E. Lemke","year":"1964","unstructured":"C.E. Lemke and J.T. Howson, \u201cEquilibrium points of bimatrix games,\u201dSIAM Review 12 (1964) 45\u201378.","journal-title":"SIAM Review"},{"key":"CR11","volume-title":"Introduction to Linear and Nonlinear Programming","author":"D.G. Luenberger","year":"1973","unstructured":"D.G. Luenberger,Introduction to Linear and Nonlinear Programming (Addison-Wesley, Reading, MA, 1973)."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/BF01268170","volume":"22","author":"O.L. Mangasarian","year":"1979","unstructured":"O.L. Mangasarian, \u201cSolution of symmetric linear complementarity problems by iterative methods,\u201dJournal of Optimization Theory and Applications 22 (1979) 465\u2013485.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01580891","volume":"56","author":"S. Mizuno","year":"1992","unstructured":"S. Mizuno, \u201cA new polynomial time algorithm for a linear complementarity problems,\u201dMathematical Programming 56 (1992) 31\u201343.","journal-title":"Mathematical Programming"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1007\/BF01585112","volume":"24","author":"J.S. Pang","year":"1982","unstructured":"J.S. Pang and D. Chan, \u201cIterative methods for variational and complementarity problems,\u201dMathematical Programming 24 (1982) 284\u2013313.","journal-title":"Mathematical Programming"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/BF02591749","volume":"31","author":"J.S. Pang","year":"1985","unstructured":"J.S. Pang, \u201cVariational inequality problems over productsets: applications and iterative methods,\u201dMathematical Programming 31 (1985) 206\u2013219.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581141.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581141\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581141","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:12:15Z","timestamp":1556896335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581141"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["BF01581141"],"URL":"https:\/\/doi.org\/10.1007\/bf01581141","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}