{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T18:30:04Z","timestamp":1726425004957},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,9,23]],"date-time":"2008-09-23T00:00:00Z","timestamp":1222128000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer. Math."],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s00211-008-0183-5","type":"journal-article","created":{"date-parts":[[2008,9,22]],"date-time":"2008-09-22T11:17:37Z","timestamp":1222082257000},"page":"251-266","source":"Crossref","is-referenced-by-count":26,"title":["An algorithm for the fast solution of symmetric linear complementarity problems"],"prefix":"10.1007","volume":"111","author":[{"given":"Jos\u00e9 Luis","family":"Morales","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge","family":"Nocedal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikhail","family":"Smelyanskiy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,9,23]]},"reference":[{"key":"183_CR1","unstructured":"Ageia physx. Web page. http:\/\/www.ageia.com\/physx\/ (2006)"},{"key":"183_CR2","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1023\/A:1008292328909","volume":"14","author":"M. Anitescu","year":"1997","unstructured":"Anitescu M., Potra F.A.: Formulating dynamic multi-rigid-body contact problems with friction as solvable linear complementarity problems. Nonlinear Dyn. 14, 231\u2013247 (1997)","journal-title":"Nonlinear Dyn."},{"issue":"2","key":"183_CR3","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/0320018","volume":"20","author":"D.P. Bertsekas","year":"1982","unstructured":"Bertsekas D.P.: Projected Newton methods for optimization problems with simple constraints. SIAM J. Control Optim. 20(2), 221\u2013246 (1982)","journal-title":"SIAM J. Control Optim."},{"key":"183_CR4","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1023\/A:1019928808826","volume":"23","author":"E.G. Birgin","year":"2002","unstructured":"Birgin E.G., Mart\u00ednez J.M.: Large-scale active-set box-constrained optimization method with spectral projected gradients. Comput. Optim. Appl. 23, 101\u2013125 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"183_CR5","doi-asserted-by":"crossref","first-page":"1196","DOI":"10.1137\/S1052623497330963","volume":"10","author":"E.G. Birgin","year":"2000","unstructured":"Birgin E.G., Mart\u00ednez J.M., Raydan M.: Nonmonotone spectral projected gradient methods on convex sets. SIOPT 10, 1196\u20131211 (2000)","journal-title":"SIOPT"},{"key":"183_CR6","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1145\/502800.502803","volume":"27","author":"E.G. Birgin","year":"2001","unstructured":"Birgin E.G., Mart\u00ednez J.M., Raydan M.: Algorithm 813: Spg-software for convex-constrained optimization. ACM Trans. Math. Softw. 27, 340\u2013349 (2001)","journal-title":"ACM Trans. Math. Softw."},{"issue":"5","key":"183_CR7","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1137\/0725068","volume":"25","author":"J.V. Burke","year":"1998","unstructured":"Burke J.V., Mor\u00e9 J.J.: On the identification of active constraints. SIAM J. Numer. Anal. 25(5), 1197\u20131211 (1998)","journal-title":"SIAM J. Numer. Anal."},{"key":"183_CR8","unstructured":"Catto, E.: Iterative dynamics with temporal coherence. Technical report, Crystal Dynamics, Menlo Park (2005)"},{"key":"183_CR9","doi-asserted-by":"crossref","unstructured":"Conn, A.R., Gould, N.I.M., Toint, Ph.L.: Global convergence of a class of trust region algorithms for optimization with simple bounds. SIAM J. Numer. Anal. 25(182):433\u2013460 (1988) [See also SIAM J. Numer. Anal. 26:764\u2013767 (1989)]","DOI":"10.1137\/0725029"},{"key":"183_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-12211-2","volume-title":"LANCELOT: a Fortran package for Large-scale Nonlinear Optimization (Release A). Springer Series in Computational Mathematics","author":"A.R. Conn","year":"1992","unstructured":"Conn A.R., Gould N.I.M., Toint Ph.L.: LANCELOT: a Fortran package for Large-scale Nonlinear Optimization (Release A). Springer Series in Computational Mathematics. Springer, Heidelberg (1992)"},{"key":"183_CR11","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0024-3795(68)90052-9","volume":"1","author":"R.W. Cottle","year":"1968","unstructured":"Cottle R.W., Dantzig G.B.: Complementarity pivot theory of mathematical programming. J. Linear Algebra Applns 1, 103\u2013125 (1968)","journal-title":"J. Linear Algebra Applns"},{"key":"183_CR12","volume-title":"The Linear Complementarity Problem","author":"R.W. Cottle","year":"1992","unstructured":"Cottle R.W., Pang J.-S., Stone R.E.: The Linear Complementarity Problem. Academic Press, London (1992)"},{"key":"183_CR13","doi-asserted-by":"crossref","unstructured":"Dai, Y.H., Fletcher, R.: Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming. Numer. Math. 100 (2005)","DOI":"10.1007\/s00211-004-0569-y"},{"key":"183_CR14","doi-asserted-by":"crossref","unstructured":"Dolan, E.D., Mor\u00e9, J.J., Munson, T.S.: Benchmarking optimization software with COPS 3.0. Technical Report ANL\/MCS-TM-273, Argonne National Laboratory, Argonne (2004)","DOI":"10.2172\/834714"},{"issue":"4","key":"183_CR15","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1137\/S0036144595285963","volume":"39","author":"M.C. Ferris","year":"1997","unstructured":"Ferris M.C., Pang J.S.: Engineering and economic applications of complementarity problems. SIAM Rev. 39(4), 669\u2013713 (1997)","journal-title":"SIAM Rev."},{"key":"183_CR16","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1051\/ro:2007009","volume":"41","author":"M.C. Ferris","year":"2007","unstructured":"Ferris M.C., Wathen A.J., Armand P.: Limited memory solution of bound constrained convex quadratic problems arising in video games. RAIRO Oper. Res. 41, 19\u201334 (2007)","journal-title":"RAIRO Oper. Res."},{"issue":"2","key":"183_CR17","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1137\/050635225","volume":"17","author":"W.W. Hager","year":"2007","unstructured":"Hager W.W., Zhang H.: A new active set algorithm for box constrained optimization. SIOPT 17(2), 526\u2013557 (2007)","journal-title":"SIOPT"},{"key":"183_CR18","unstructured":"Havok, F.X.: Web page. http:\/\/www.havok.com\/content\/view\/187\/77\/ (2006)"},{"key":"183_CR19","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s002110050050","volume":"68","author":"M. Kocvara","year":"1994","unstructured":"Kocvara M., Zowe J.: An iterative two-step algorithm for linear complementarity problems. Numer. Math. 68, 95\u2013106 (1994)","journal-title":"Numer. Math."},{"key":"183_CR20","doi-asserted-by":"crossref","unstructured":"Kumar, S., Hughes, C.J., Nguyen, A. Carbon: architectural support for fine-grained parallelism on chip multiprocessors. In: Proceedings of IEEE\/ACM International Symposium on Computer Architecture (ISCA), San Diego (2007)","DOI":"10.1145\/1250662.1250683"},{"issue":"4","key":"183_CR21","doi-asserted-by":"crossref","first-page":"1100","DOI":"10.1137\/S1052623498345075","volume":"9","author":"C.J. Lin","year":"1999","unstructured":"Lin C.J., Mor\u00e9 J.J.: Newton\u2019s method for large bound-constrained optimization problems. SIAM J. Optim. 9(4), 1100\u20131127 (1999)","journal-title":"SIAM J. Optim."},{"key":"183_CR22","first-page":"141","volume":"14","author":"J.L Morales","year":"1994","unstructured":"Morales J.L, Sargent R.W.H.: Computational experience with several methods for large-scale convex quadratic programming. Aportaciones Matem\u00e1ticas. Comunicaciones 14, 141\u2013158 (1994)","journal-title":"Aportaciones Matem\u00e1ticas. Comunicaciones"},{"issue":"1","key":"183_CR23","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1137\/0801008","volume":"1","author":"J.J. Mor\u00e9","year":"1991","unstructured":"Mor\u00e9 J.J., Toraldo G.: On the solution of large quadratic programming problems with bound constraints. SIAM J. Optim. 1(1), 93\u2013113 (1991)","journal-title":"SIAM J. Optim."},{"key":"183_CR24","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0024-3795(80)90173-1","volume":"34","author":"D.P. O\u2019Leary","year":"1980","unstructured":"O\u2019Leary D.P.: A generalized conjugate gradient algorithm for solving a class of quadratic programming problems. Linear Algebra Appl. 34, 371\u2013399 (1980)","journal-title":"Linear Algebra Appl."},{"key":"183_CR25","doi-asserted-by":"crossref","unstructured":"Schenk, O.: Scalable parallel sparse LU factorization methods on shared memory multiprocessors. PhD thesis, Swiss Federal Institute of Technology, Zurich (2000)","DOI":"10.1007\/BFb0100583"},{"issue":"3","key":"183_CR26","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.future.2003.07.011","volume":"20","author":"O. Schenk","year":"2004","unstructured":"Schenk O., G\u00e4rtner K.: Solving unsymmetric sparse systems of linear equations with pardiso. J. Future Generation Comput. Syst. 20(3), 475\u2013487 (2004)","journal-title":"J. Future Generation Comput. Syst."},{"key":"183_CR27","first-page":"158","volume":"23","author":"O. Schenk","year":"2006","unstructured":"Schenk O., G\u00e4rtner K.: On fast factorization pivoting methods for symmetric indefinite systems. Elec. Trans. Numer. Anal. 23, 158\u2013179 (2006)","journal-title":"Elec. Trans. Numer. Anal."},{"key":"183_CR28","doi-asserted-by":"crossref","unstructured":"Smelyanskiy, M., Lee, V. W., Kim, D., Nguyen, A.D., Dubey, P.: Scaling performance of interior-point methods on a large-scale chip multiprocessor system. In: SC \u201907: Proceedings of the 2007 ACM\/IEEE conference on Supercomputing (2007)","DOI":"10.1145\/1362622.1362652"},{"key":"183_CR29","unstructured":"Smith, R.: Open dynamics engine. Technical report. http:\/\/www.ode.org (2004)"},{"key":"183_CR30","volume-title":"Quantitative Finance","author":"P. Wilmott","year":"2006","unstructured":"Wilmott P.: Quantitative Finance. Wiley, London (2006)"},{"key":"183_CR31","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Interior-Point Methods","author":"S.J. Wright","year":"1997","unstructured":"Wright S.J.: Primal-Dual Interior-Point Methods. SIAM, Philadelphia (1997)"},{"issue":"4","key":"183_CR32","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1145\/279232.279236","volume":"23","author":"C. Zhu","year":"1997","unstructured":"Zhu C., Byrd R.H., Lu P., Nocedal J.: Algorithm 78: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization. ACM Trans. Math. Softw. 23(4), 550\u2013560 (1997)","journal-title":"ACM Trans. Math. Softw."}],"container-title":["Numerische Mathematik"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-008-0183-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00211-008-0183-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-008-0183-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T16:22:41Z","timestamp":1558628561000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00211-008-0183-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,23]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["183"],"URL":"https:\/\/doi.org\/10.1007\/s00211-008-0183-5","relation":{},"ISSN":["0029-599X","0945-3245"],"issn-type":[{"value":"0029-599X","type":"print"},{"value":"0945-3245","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,9,23]]}}}