{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:05:34Z","timestamp":1747548334871},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[1996,1]]},"DOI":"10.1007\/bf00429751","type":"journal-article","created":{"date-parts":[[2004,12,10]],"date-time":"2004-12-10T02:20:00Z","timestamp":1102645200000},"page":"49-77","source":"Crossref","is-referenced-by-count":5,"title":["An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems"],"prefix":"10.1007","volume":"5","author":[{"given":"L.","family":"Fernandes","sequence":"first","affiliation":[]},{"given":"J.","family":"J\ufffddice","sequence":"additional","affiliation":[]},{"given":"J.","family":"Patr\ufffdcio","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"Constrained Optimization and Lagrange Multipliers","author":"D. Bertsekas","year":"1982","unstructured":"D.Bertsekas, Constrained Optimization and Lagrange Multipliers, Academic Press: New York, 1982."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1137\/0320018","volume":"20","author":"D. Bertsekas","year":"1982","unstructured":"D.Bertsekas, ?Projected Newton methods for optimization problems with simple constraints,? SIAM Journal on control and Optimization, vol. 20, pp. 222?246, 1982.","journal-title":"SIAM Journal on control and Optimization"},{"key":"CR3","volume-title":"Convergence of interior-point algorithms from arbitrary starting points","author":"S. Billups","year":"1993","unstructured":"S.Billups and M.Ferris, ?Convergence of interior-point algorithms from arbitrary starting points? Working Paper, Computer Sciences Department, University of Wisconsin, Madison, USA, 1993."},{"key":"CR4","volume-title":"Numerical Analysis","author":"R.L. Burden","year":"1981","unstructured":"R.L.Burden, J.D.Faires, and A.Reynolds, Numerical Analysis, Prindle, Weber and Schmidt, Boston, 1981."},{"key":"CR5","first-page":"263","volume":"7","author":"R. Chandrasekaran","year":"1970","unstructured":"R.Chandrasekaran, ?A special case of the complementary pivot problem,? Opsearch, vol. 7, pp. 263?268, 1970.","journal-title":"Opsearch"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1137\/0716029","volume":"16","author":"A.K. Cline","year":"1979","unstructured":"A.K.Cline, C.B.Moler, G.W.Stewart, and J.H.Wilkinson, ?An estimate for the condition number of a matrix,? SIAM. J. Numer. Anal. vol. 16, pp. 368?378, 1979.","journal-title":"SIAM. J. Numer. Anal."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF01589112","volume":"45","author":"T. Coleman","year":"1989","unstructured":"T.Coleman and L.Hulbert, ?A direct active set algorithm for large sparse quadratic programs with bounds,? Mathematical Programming, vol. 45, pp. 373?406, 1989.","journal-title":"Mathematical Programming"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0803014","volume":"3","author":"T. Coleman","year":"1993","unstructured":"T.Coleman and L.Hulbert, ?A globally and superlinearly convergent algorithm for convex quadratic programs with bounds,?, SIAM Journal on Optimization, vol. 3, pp. 298?321, 1993.","journal-title":"SIAM Journal on Optimization"},{"key":"CR9","volume-title":"Technical Report TR 92-1315","author":"T. Coleman","year":"1992","unstructured":"T.Coleman and Y.Li, ?A reflective Newton method for minimizing a quadratic function subject to bounds on some of the variables,? Technical Report TR 92-1315, Department of Computer Science, Cornell University, USA, 1992."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1137\/0725029","volume":"25","author":"A. Conn","year":"1988","unstructured":"A.Conn, N.Gould, and Ph.Toint, ?Global convergence of a class of trust regions algorithms for optimization with simple bounds,? SIAM Journal on Numerical Analysis, vol. 25, pp. 433?460, 1988.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR11","volume-title":"The Linear Complementarity Problem","author":"R. Cottle","year":"1992","unstructured":"R.Cottle, J.Pang, and R.Stone, The Linear Complementarity Problem, Academic Press: New York, 1992."},{"key":"CR12","volume-title":"On the minimization of quadratic functions subject to box constraints","author":"R. Dembo","year":"1983","unstructured":"R.Dembo and U.Tulowitzski, ?On the minimization of quadratic functions subject to box constraints,? Technical Report, Department of Computer Science, Yale University, USA, 1983."},{"key":"CR13","volume-title":"The linear complementarity problem, sufficient matrices and the criss-cross method","author":"D. Hertog Den","year":"1990","unstructured":"D.DenHertog, C.Roos, and T.Terlaky, ?The linear complementarity problem, sufficient matrices and the criss-cross method,? Working Paper, Delft University of Technology, Delft, Netherlands, 1990."},{"key":"CR14","volume-title":"Numerical Methods for Unconstrained Optimization and Nonlinear Equations","author":"J. Dennis Jr.","year":"1983","unstructured":"J.DennisJr. and R.Schnabel, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall: Englewood Cliffs, New York, 1983."},{"key":"CR15","volume-title":"Direct Methods for Sparse Matrices","author":"I. Duff","year":"1986","unstructured":"I.Duff, A.Erisman, and J.Reid, Direct Methods for Sparse Matrices, Clarendon Press: Oxford, 1986."},{"key":"CR16","volume-title":"Technical Report R. 10533","author":"I.S. Duff","year":"1982","unstructured":"I.S.Duff and J.K.Reid, MA27?a set of Fortran subroutines for solving sparse symmetric sets of linear equations, Technical Report R. 10533, AERE, Harwell, England, 1982."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/62038.62043","volume":"15","author":"I.S. Duff","year":"1989","unstructured":"I.S.Duff, R.G.Grimes, and J.G.Lewis, ?Sparse matrix test problems,? ACM Transactions on Mathematical Software, vol. 15, pp. 1?14, 1989.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1080\/02331939208843855","volume":"26","author":"F. Facchinei","year":"1992","unstructured":"F.Facchinei and S.Lucidi, ?A class of penalty functions for optimization problems with bound constraints,? Optimization, vol. 26, pp. 239?259, 1992.","journal-title":"Optimization"},{"key":"CR19","unstructured":"L. Fernandes, Solution of Large-Scale Monotone Linear Complementarity Problems, Master's Thesis, University of Lisbon, 1992. (in portuguese)."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1093\/imamat\/14.2.159","volume":"14","author":"R. Fletcher","year":"1974","unstructured":"R.Fletcher and M.Jackson, ?Minimization of a quadratic function subject only to upper and lower bounds,? Journal Institute of Mathematics and Applications vol. 14, pp. 159?174, 1974.","journal-title":"Journal Institute of Mathematics and Applications"},{"key":"CR21","volume-title":"A new method for box constrained convex quadratic minimization problems","author":"A. Friedlander","year":"1993","unstructured":"A.Friedlander, J.Martinez, and M.Raydan, ?A new method for box constrained convex quadratic minimization problems,? Working Paper, Department of Applied Mathematics, University of Campinas, Campinas, Brazil, 1993."},{"key":"CR22","unstructured":"A. Friedlander, J. Martinez, and S. Santos, ?A new trust-region algorithm for bound contrained minimization,? To appear in Applied Mathematics and Optimization, 1993."},{"key":"CR23","volume-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"J.A. George","year":"1981","unstructured":"J.A.George and J.W.H.Liu, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall: Englewood Cliffs, NJ., 1981."},{"key":"CR24","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1007\/BF01385810","volume":"59","author":"L. Grippo","year":"1991","unstructured":"L.Grippo, L.Lampariello, and S.Lucidi, ?A class of nonmonotone stabilization methods in unconstrained optimization,? Numerische Mathematik, vol. 59, pp. 779?805, 1991.","journal-title":"Numerische Mathematik"},{"key":"CR25","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1287\/trsc.26.1.48","volume":"26","author":"F. Guder","year":"1992","unstructured":"F.Guder, J.Morris, and S.Yoon, ?Parallel and serial successive overrelaxation for multicommodity spatial price equilibrium problems,? Transportation Science, vol. 26, pp. 48?58, 1992.","journal-title":"Transportation Science"},{"key":"CR26","first-page":"92","volume-title":"Large-Scale Numerical Optimization","author":"C. Han","year":"1990","unstructured":"C.Han, P.Pardalos, and Y.Ye, ?Computational aspects of an interior point algorithm for quadratic problems with box constraints,? in T.Coleman and Y.Li (Eds.), Large-Scale Numerical Optimization, pp. 92?112. SIAM, Philadelphia, 1990."},{"key":"CR27","series-title":"Lecture Notes in Applied Mathematics","first-page":"265","volume-title":"Computational Solution of Nonlinear Equations","author":"P. Harker","year":"1990","unstructured":"P.Harker and J.Pang, ?A damped Newton's method for the linear complementarity problem,? in E.Allgower and K.Georg (Eds.), Computational Solution of Nonlinear Equations, Lecture Notes in Applied Mathematics 26, pp. 265?284, American Mathematical Society, Providence, 1990."},{"key":"CR28","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01582255","volume":"48","author":"J. Harker","year":"1990","unstructured":"J.Harker and J.Pang, ?Finite-dimensional variational inequalities and nonlinear complementarity problems: a survey of theory, algorithms and applications,? Mathematical Programming, vol. 48, pp. 161?220, 1990.","journal-title":"Mathematical Programming"},{"key":"CR29","first-page":"23","volume":"9","author":"J. J\u00fadice","year":"1989","unstructured":"J.J\u00fadice and M.Pires, ?Direct methods for convex quadratic programs subject to box constraints,? Investiga\u00e7\u00e3o Operacional, vol. 9, pp. 23?56, 1989.","journal-title":"Investiga\u00e7\u00e3o Operacional"},{"key":"CR30","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1016\/0305-0548(94)90106-6","volume":"21","author":"J. J\u00fadice","year":"1994","unstructured":"J.J\u00fadice and M.Pires, ?A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems,? Computers and Operations Research, vol. 21, pp. 587?596, 1994.","journal-title":"Computers and Operations Research"},{"key":"CR31","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmakar","year":"1984","unstructured":"N.Karmakar, ?A new polynomial-time algorithm for linear programming,? Combinatorica, vol. 4, pp. 373?395, 1984.","journal-title":"Combinatorica"},{"key":"CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-54509-3","volume-title":"A Unified Approach to Interior-Point Algorithms for Linear Complementarity Problems","author":"M. Kojima","year":"1991","unstructured":"M.Kojima, N.Megiddo, T.Noma, and A.Yoshise, A Unified Approach to Interior-Point Algorithms for Linear Complementarity Problems, Lecture Notes in Computer Science 538, Springer-Verlag: Berlin, 1991."},{"key":"CR33","unstructured":"M. Kostreva, Direct Algorithms for Complementarity Problems Ph.D. Thesis, Rensselaer Polytechnique Institute, New York, 1976."},{"key":"CR34","first-page":"95","volume-title":"Mathematics of Decision Sciences","author":"C. Lemke","year":"1968","unstructured":"C.Lemke, ?On complementary pivot theory,? in G.Dantzig and A.Veinott, (Eds.), Mathematics of Decision Sciences, pp. 95?114, American Mathematical Society, Providence, 1968."},{"key":"CR35","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1137\/0325023","volume":"25","author":"Y. Lin","year":"1987","unstructured":"Y.Lin and J.Pang, ?Iterative methods for large convex quadratic programs: a survey,? SIAM Journal on Control and Optimization, vol. 25, pp. 383?411, 1987.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"CR36","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1137\/0802022","volume":"2","author":"I. Lustig","year":"1992","unstructured":"I.Lustig, R.Marsten, and D.Shanno, ?On implementing Mehrotra's predictor-corrector interior-point method for linear programming,? SIAM Journal on Optimization, vol. 2, pp. 435?449, 1992.","journal-title":"SIAM Journal on Optimization"},{"key":"CR37","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1137\/0131009","volume":"31","author":"O. Mangasarian","year":"1976","unstructured":"O.Mangasarian, ?Equivalence of the complementarity problem to a system of nonlinear equations,? SIAM Journal on Applied Mathematics, vol. 31, pp. 89?92, 1976.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"CR38","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S. Mehrotra","year":"1992","unstructured":"S.Mehrotra, ?On the implementation of a primal-dual interior-point method,? SIAM Journal on Optimization, vol. 2, pp. 575?601, 1992.","journal-title":"SIAM Journal on Optimization"},{"key":"CR39","volume-title":"Infeasible interior-point primal-dual potential-reduction algorithms for linear programming","author":"S. Mizuno","year":"1993","unstructured":"S.Mizuno, M.Kojima, and M.Todd, ?Infeasible interior-point primal-dual potential-reduction algorithms for linear programming,? Working Paper, School of Operations Research and Industrial Engineering, Cornell University, New York, 1993."},{"key":"CR40","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF01396045","volume":"55","author":"J. Mor\u00e9","year":"1989","unstructured":"J.Mor\u00e9 and G.Toraldo, ?Algorithms for bound constrained quadratic programming problems,? Numerische Mathematik, vol. 55, pp. 377?400, 1989.","journal-title":"Numerische Mathematik"},{"key":"CR41","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1137\/0801008","volume":"1","author":"J. Mor\u00e9","year":"1991","unstructured":"J.Mor\u00e9 and G.Toraldo, ?On the solution of large quadratic programming problems with bound constraints,? SIAM Journal on Optimization, vol. 1, pp. 93?113, 1991.","journal-title":"SIAM Journal on Optimization"},{"key":"CR42","first-page":"123","volume":"11","author":"K. Murty","year":"1974","unstructured":"K.Murty, ?Note on a Bard-type scheme for solving the complementarity problem,? Opsearch, vol. 11, pp. 123?130, 1974.","journal-title":"Opsearch"},{"key":"CR43","volume-title":"Linear Complementarity, Linear and Nonlinear Programming","author":"K. Murty","year":"1988","unstructured":"K.Murty, Linear Complementarity, Linear and Nonlinear Programming, Heldermann Verlag: Berlin, 1988."},{"key":"CR44","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-2112-3","volume-title":"Introduction to Parallel and Vector Solution of Linear Systems","author":"J. Ortega","year":"1988","unstructured":"J.Ortega, Introduction to Parallel and Vector Solution of Linear Systems, Plenum Press: New York, 1988."},{"key":"CR45","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01582119","volume":"16","author":"J. Pang","year":"1979","unstructured":"J.Pang, ?On a class of least-element complementarity problems,? Mathematical Programming, vol. 16, pp. 325?347, 1979.","journal-title":"Mathematical Programming"},{"key":"CR46","doi-asserted-by":"crossref","unstructured":"P. Pardalos, Y. Ye, C. Han, and J. Kaliski, ?Solution of P 0-matrix linear complementarity problems using a potential reduction algorithm,? To appear in SIAM Journal of Matrix Analysis and Applications, 1993.","DOI":"10.1137\/0614069"},{"key":"CR47","volume-title":"An investigation of interior-point algorithms for the linear transportation problem","author":"L. Portugal","year":"1993","unstructured":"L.Portugal, F.Bastos, J.J\u00fadice, J.Paix\u00e3o, and T.Terlaky, ?An investigation of interior-point algorithms for the linear transportation problem,? Working Paper, Department of Mathematics, University of Coimbra, Portugal, 1993."},{"key":"CR48","volume-title":"Rutgers Research Report RRR 18-93","author":"D. Shanno","year":"1993","unstructured":"D.Shanno, ?Computational experience with logarithmic barrier methods for liner and nonlinear complementarity problems,? Rutgers Research Report RRR 18-93, Rutcor University, New Brunswick, USA, 1993."},{"key":"CR49","volume-title":"Technical Report MCS-P 334-1192","author":"S. Wright","year":"1992","unstructured":"S.Wright, ?A path following infeasible interior-point algorithm for linear complementarity problems,? Technical Report MCS-P 334-1192, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, USA, 1992."},{"key":"CR50","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF01586934","volume":"51","author":"E. Yang","year":"1991","unstructured":"E.Yang and J.Tolle, ?A class of methods for solving large convex quadratic programs subject to box constraints,? Mathematical Programming, vol. 51, pp. 223?228, 1991.","journal-title":"Mathematical Programming"},{"key":"CR51","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0024-3795(91)90264-W","volume":"152","author":"Y. Ye","year":"1991","unstructured":"Y.Ye and P.Pardalos, ?A class of linear complementarity problems solvable in polynomial time,? Linear Algebra and its Applications, vol. 152, pp. 3?19, 1991.","journal-title":"Linear Algebra and its Applications"},{"key":"CR52","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1137\/0804012","volume":"4","author":"Y. Zhang","year":"1994","unstructured":"Y.Zhang, ?On the convergence of a class of infeasible interior-point methods for the horizontal linear complementarity problem?, SIAM Journal on Optimization, vol. 4, pp. 208?227, 1994.","journal-title":"SIAM Journal on Optimization"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00429751.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00429751\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00429751","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T16:20:25Z","timestamp":1586017225000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00429751"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,1]]}},"alternative-id":["BF00429751"],"URL":"https:\/\/doi.org\/10.1007\/bf00429751","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,1]]}}}