{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:46:42Z","timestamp":1772909202404,"version":"3.50.1"},"reference-count":36,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"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":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[1994,5]]},"DOI":"10.1016\/0305-0548(94)90106-6","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:15:45Z","timestamp":1056975345000},"page":"587-596","source":"Crossref","is-referenced-by-count":35,"title":["A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems"],"prefix":"10.1016","volume":"21","author":[{"given":"Joaquim J.","family":"J\u00fadice","sequence":"first","affiliation":[]},{"given":"Fernanda M.","family":"Pires","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(94)90106-6_BIB1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01582255","article-title":"Finite-dimensional variational inequality and nonlinear complementarity problems: a survey of theory, algorithms and applications","volume":"48","author":"Harker","year":"1990","journal-title":"Mathl Program."},{"key":"10.1016\/0305-0548(94)90106-6_BIB2","series-title":"Linear Complementarity, Linear and Nonlinear Programming","author":"Murty","year":"1988"},{"key":"10.1016\/0305-0548(94)90106-6_BIB3","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01582119","article-title":"On the solution of some (parametric) linear complementarity problems with applications to portfolio analysis, structural engineering and graduation","volume":"16","author":"Pang","year":"1979","journal-title":"Mathl Program."},{"key":"10.1016\/0305-0548(94)90106-6_BIB4","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01589334","article-title":"A parametric linear complementarity technique for the computation of equilibrium in a single commodity spatial model","volume":"20","author":"Pang","year":"1981","journal-title":"Mathl Program."},{"key":"10.1016\/0305-0548(94)90106-6_BIB5","article-title":"Finite elements and variational inequalities","author":"Glowinski","year":"1978"},{"key":"10.1016\/0305-0548(94)90106-6_BIB6","series-title":"Practical Optimization","author":"Gill","year":"1981"},{"key":"10.1016\/0305-0548(94)90106-6_BIB7","article-title":"Newton's method for generalized equations","author":"Josephy","year":"1979"},{"key":"10.1016\/0305-0548(94)90106-6_BIB8","series-title":"The Linear Complementarity Problem","author":"Cottle","year":"1992"},{"key":"10.1016\/0305-0548(94)90106-6_BIB9","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF02591868","article-title":"Iterative methods for linear complementarity with upper-bounds on primary variables","volume":"26","author":"Ahn","year":"1983","journal-title":"Mathl Program."},{"key":"10.1016\/0305-0548(94)90106-6_BIB10","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1287\/opre.15.3.482","article-title":"A principal pivoting simplex algorithm for linear and quadratic programming","volume":"15","author":"Graves","year":"1967","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90106-6_BIB11","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF01580136","article-title":"The general quadratic optimization problem","volume":"5","author":"Keller","year":"1973","journal-title":"Mathl Program."},{"key":"10.1016\/0305-0548(94)90106-6_BIB12","first-page":"123","article-title":"Note on a Bard-type scheme for solving the complementarity problem","volume":"11","author":"Murty","year":"1974","journal-title":"Opsearch"},{"key":"10.1016\/0305-0548(94)90106-6_BIB13","first-page":"51","article-title":"Bard-type methods for the linear complementarity problem with symmetric positive matrices","volume":"2","author":"J\u00fadice","year":"1988","journal-title":"IMA J. maths appl. business Indust."},{"key":"10.1016\/0305-0548(94)90106-6_BIB14","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0024-3795(78)90083-6","article-title":"Block pivot methods for solving the complementarity problem","volume":"21","author":"Kostreva","year":"1978","journal-title":"Linear algebra Applic."},{"key":"10.1016\/0305-0548(94)90106-6_BIB15","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1002\/1520-6750(199004)37:2<279::AID-NAV3220370207>3.0.CO;2-V","article-title":"A Bard-type method for a generalized linear complementarity problem with a nonsingular M-matrix","volume":"37","author":"J\u00fadice","year":"1990","journal-title":"Nav. Res. Logist."},{"key":"10.1016\/0305-0548(94)90106-6_BIB16","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/BF00940317","article-title":"A basic-set algorithm for a generalized linear complementarity problem","volume":"74","author":"J\u00fadice","year":"1992","journal-title":"J. optimiz. theory and Appl."},{"key":"10.1016\/0305-0548(94)90106-6_BIB17","first-page":"211","article-title":"A polynomial method for a generalized linear complementarity problem with a nonsingular M-matrix","volume":"4","author":"J\u00fadice","year":"1992","journal-title":"IMA J. maths appl. business Indust."},{"key":"10.1016\/0305-0548(94)90106-6_BIB18","first-page":"23","article-title":"Direct methods for convex quadratic programs subject to box constraints","volume":"9","author":"J\u00fadice","year":"1989","journal-title":"Invest. Opl"},{"key":"10.1016\/0305-0548(94)90106-6_BIB19","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1287\/opre.28.3.754","article-title":"A new and efficient algorithm for a class of portfolio selection problems","volume":"28","author":"Pang","year":"1980","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90106-6_BIB20","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01582097","article-title":"On a class of least-element complementarity problems","volume":"16","author":"Pang","year":"1979","journal-title":"Mathl Program."},{"key":"10.1016\/0305-0548(94)90106-6_BIB21","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF01589112","article-title":"A direct active set algorithm for large sparse quadratic programs with bounds","volume":"45","author":"Coleman","year":"1989","journal-title":"Mathl Program."},{"key":"10.1016\/0305-0548(94)90106-6_BIB22","first-page":"31","article-title":"Solution of large-scale strictly convex linear complementarity problems","volume":"11","author":"J\u00f9dice","year":"1991","journal-title":"Invest. Opl"},{"key":"10.1016\/0305-0548(94)90106-6_BIB23","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1137\/0801008","article-title":"On the solution of large quadratic programming problems with bound constraints","volume":"1","author":"Mor\u00e9","year":"1991","journal-title":"SIAM J. Optimiz."},{"key":"10.1016\/0305-0548(94)90106-6_BIB24","series-title":"A class of methods for solving large convex quadratic programs subject to box constraints","author":"Yang","year":"1985"},{"key":"10.1016\/0305-0548(94)90106-6_BIB25","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1093\/imamat\/14.2.159","article-title":"Minimization of a quadratic function subject only to upper and lower bounds","volume":"14","author":"Fletcher","year":"1974","journal-title":"J. Inst. maths and Appl."},{"key":"10.1016\/0305-0548(94)90106-6_BIB26","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0024-3795(80)90173-1","article-title":"A generalized conjugate-gradient algorithm for solving a class of quadratic programming problems","volume":"34","author":"O'Leary","year":"1980","journal-title":"Linear algebra Applic."},{"key":"10.1016\/0305-0548(94)90106-6_BIB27","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1137\/0309028","article-title":"The solution of a quadratic programming problem using systematic overrelaxation","volume":"9","author":"Cryer","year":"1971","journal-title":"J. SIAM Control"},{"key":"10.1016\/0305-0548(94)90106-6_BIB28","first-page":"265","article-title":"A damped-Newton method for the linear complementarity problem","volume":"26","author":"Harker","year":"1990","journal-title":"Lectures appl. Maths"},{"key":"10.1016\/0305-0548(94)90106-6_BIB29","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0167-6377(91)90010-M","article-title":"A unified approach to interior point algorithms for linear complenentarity problems: a summary","volume":"10","author":"Kojima","year":"1991","journal-title":"Ops Res. Lett."},{"key":"10.1016\/0305-0548(94)90106-6_BIB30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01587074","article-title":"A polynomal-time algorithm for a class of linear complementarity problems","volume":"44","author":"Kojima","year":"1989","journal-title":"Mathl Program."},{"key":"10.1016\/0305-0548(94)90106-6_BIB31","first-page":"413","article-title":"An interior-point algorithm for large-scale quadratic problems subject to box constraints","volume":"144","author":"Pardalos","year":"1990"},{"key":"10.1016\/0305-0548(94)90106-6_BIB32","article-title":"Solution of P-matrix linear complementarity problems using a potential reducting algorithm","author":"Pardalos","year":"1990"},{"key":"10.1016\/0305-0548(94)90106-6_BIB33","series-title":"Direct Methods for Sparse Matrices","author":"Duff","year":"1986"},{"key":"10.1016\/0305-0548(94)90106-6_BIB34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/62038.62043","article-title":"Sparse matrix text problems","volume":"15","author":"Duff","year":"1989","journal-title":"ACM Trans. mathl Softw."},{"key":"10.1016\/0305-0548(94)90106-6_BIB35","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1002\/nav.3800310408","article-title":"Application of disjunctive programming to the linear complementarity problem","volume":"31","author":"Ramarao","year":"1984","journal-title":"Naval Res. Logist. Q."},{"key":"10.1016\/0305-0548(94)90106-6_BIB36","series-title":"Computer Solution of Large Positive Definite Systems","author":"George","year":"1981"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894901066?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894901066?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:26:45Z","timestamp":1552915605000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054894901066"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":36,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["0305054894901066"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)90106-6","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}