{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:51:37Z","timestamp":1725490297608},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679561"},{"type":"electronic","value":"9783540445203"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44520-x_116","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T03:51:43Z","timestamp":1188359503000},"page":"839-848","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Parallel Implementation of a Potential Reduction Algorithm for Box-Constrained Quadratic Programming"],"prefix":"10.1007","author":[{"given":"Marco","family":"D\u2019Apuzzo","sequence":"first","affiliation":[]},{"given":"Marina","family":"Marino","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]},{"given":"Gerardo","family":"Toraldo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,8,18]]},"reference":[{"key":"116_CR1","volume-title":"LAPACK User\u2019s Guide","author":"E. Anderson","year":"1995","unstructured":"E. Anderson, Z. Bai, C. Bischof, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarlig, A. McKenney, S. Ostrouchov and D. Sorensen-LAPACK User\u2019s Guide, Second Edition-SIAM, Philadelphia, PA (1995).","edition":"Second Edition"},{"issue":"3","key":"116_CR2","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1080\/10556789508805613","volume":"5","author":"J.L. Barlow","year":"1995","unstructured":"J.L. Barlow and G. Toraldo-The effect of diagonal scaling on projected gradient methods for bound constrained quadratic programming problems-Opt. Methods and Soft., vol. 5 n. 3, pp. 235\u2013245 (1995).","journal-title":"Opt. Methods and Soft."},{"key":"116_CR3","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719642","volume-title":"ScaLAPACK User\u2019s Guide","author":"L. S. Blackford","year":"1997","unstructured":"L. S. Blackford, J. Choi, A. Cleary, E. D\u2019Azevedo, J. Demmel, I. Dhillon, J. Dongarra, S. Hammarling, G. Henry, A. Petitet, K. Stanley, D. Walker, and R.C. Whaley-ScaLAPACK User\u2019s Guide-SIAM, Philadelphia, PA (1997)."},{"doi-asserted-by":"crossref","unstructured":"J. Choi, J. Dongarra, S. Ostrouchov, A. Petitet, D. Walker, and R.C. Whaley-A Proposal for a Set of Parallel Basic Linear Algebra Subprograms- LAPACK Working Note #100, University of Tennessee (1995).","key":"116_CR4","DOI":"10.1007\/3-540-60902-4_13"},{"key":"116_CR5","first-page":"125","volume":"27","author":"M. Dapuzzo","year":"1997","unstructured":"M. D\u2019Apuzzo, V. De Simone, M. Marino, and G. Toraldo-Parallel Computational Issues for Box-Constrained Quadratic Programming-Ricerca Operativa, vol. 27 n. 81\/82, pp. 125\u2013141 (1997).","journal-title":"Ricerca Operativa"},{"doi-asserted-by":"crossref","unstructured":"M. D\u2019Apuzzo, V. De Simone, M. Marino, and G. Toraldo-Modifying the Cholesky Factorization on MIMD Distributed Memory Machines- in \u201cHigh Performance Algorithms and Software in Nonlinear Optimization\u201d, R. De Leone et al. (eds.), Kluwer Academic Publishers, pp. 125\u2013141 (1998).","key":"116_CR6","DOI":"10.1007\/978-1-4613-3279-4_9"},{"unstructured":"J. Dongarra and R.C. Whaley-A User\u2019s Guide to the BLACS v1.0-Technical Report UT CS-95-281, LAPACK Working Note #94, University of Tennessee (1995).","key":"116_CR7"},{"key":"116_CR8","first-page":"92","volume-title":"Large-Scale Numerical Optimization","author":"C.G. Han","year":"1990","unstructured":"C.G. Han, P.M. Pardalos, and Y. Ye-Computational aspects of an interior point algorithm for quadratic problems with box constraints-in \u201cLarge-Scale Numerical Optimization\u201d, T. Coleman and Y. Li eds., SIAM, PA, pp. 92\u2013112 (1990)."},{"key":"116_CR9","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar-","year":"1984","unstructured":"N. Karmarkar-A New Polynomial Time Algorithm for Linear Programming-Combinatorica, vol. 4, pp. 373\u2013395 (1984).","journal-title":"Combinatorica"},{"key":"116_CR10","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01594942","volume":"50","author":"M. Kojima","year":"1991","unstructured":"M. Kojima, N. Megiddo, and A. Yoshise-An O(**vnL) Iteration Potential Reduction Algorithm for Linear Complementarity Problems-Mathematical Programming, vol. 50, pp. 331\u2013342 (1991).","journal-title":"Mathematical Programming"},{"unstructured":"J.J. Mor\u00e9 and G. Toraldo-Algorithms for bound constrained quadratic programming problems-Numerische Mathematik, n. 55, pp. 377\u2013400 (1989).","key":"116_CR11"},{"key":"116_CR12","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1287\/moor.15.3.508","volume":"15","author":"M.J. Todd","year":"1990","unstructured":"M.J. Todd and Y. Ye-A Centered Projective Algorithm for Linear Programming-Mathematics of Oper. Res., vol. 15, pp. 508\u2013529 (1990).","journal-title":"Mathematics of Oper. Res."},{"key":"116_CR13","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF02165096","volume":"14","author":"A. Sluis- van der","year":"1969","unstructured":"A. van der Sluis-Condition numbers and equilibration of matrices-Numerische Mathematik, vol. 14, pp. 14\u201323 (1969).","journal-title":"Numerische Mathematik"},{"key":"116_CR14","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF01594937","volume":"50","author":"Y. Ye-","year":"1991","unstructured":"Y. Ye-An O(n\n                           3\n                           L) potential reduction algorithm for linear programming-Mathematical Programming, vol. 50, pp. 239\u2013258 (1991).","journal-title":"Mathematical Programming"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2000 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44520-X_116","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:27:06Z","timestamp":1587342426000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44520-X_116"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679561","9783540445203"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44520-x_116","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"18 August 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}