{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T17:48:59Z","timestamp":1775324939564,"version":"3.50.1"},"reference-count":25,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"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":["Parallel Computing"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0167-8191(03)00017-6","type":"journal-article","created":{"date-parts":[[2003,3,26]],"date-time":"2003-03-26T00:16:29Z","timestamp":1048637789000},"page":"467-483","source":"Crossref","is-referenced-by-count":13,"title":["Parallel computational issues of an interior point method for solving large bound-constrained quadratic programming problems"],"prefix":"10.1016","volume":"29","author":[{"given":"M.","family":"D\u2019Apuzzo","sequence":"first","affiliation":[]},{"given":"M.","family":"Marino","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(03)00017-6_BIB1","series-title":"Interior-point methods of mathematical programming","first-page":"189","article-title":"Implementation of interior point methods for large scale linear programming","author":"Andersen","year":"1996"},{"key":"10.1016\/S0167-8191(03)00017-6_BIB2","unstructured":"H.Y. Benson, D.F. Shanno, R.J. Vanderbei, Interior-point methods for convex nonlinear programming: jamming and comparative numerical testing, Op. Res. and Fin. Eng., ORFE-00-02, Princeton University, 2000"},{"key":"10.1016\/S0167-8191(03)00017-6_BIB3","doi-asserted-by":"crossref","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, R.C. Whaley, ScaLAPACK Users\u2019 Guide, SIAM, 1997","DOI":"10.1137\/1.9780898719642"},{"issue":"4","key":"10.1016\/S0167-8191(03)00017-6_BIB4","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1137\/S1052623497325107","article-title":"An interior point algorithm for large-scale nonlinear programming","volume":"9","author":"Byrd","year":"1999","journal-title":"SIAM J. Optim."},{"key":"10.1016\/S0167-8191(03)00017-6_BIB5","unstructured":"S. Cafieri, M. D\u2019Apuzzo, M. Marino, A. Mucherino, G. Toraldo, An Interior Point Solver for Sparse Quadratic Programs with Bound Constraints, CPS Tech. Report TR-06-02, Center for Research on Parallel Computing and Supercomputers, CPS-CNR, 2002"},{"key":"10.1016\/S0167-8191(03)00017-6_BIB6","unstructured":"J. Choi, J. Dongarra, S. Ostrouchov, A. Petitet, D. Walker, R.C. Whaley, A Proposal for a Set of Parallel Basic Linear Algebra Subprograms, Tech. Report UT, CS-95-292, LAPACK Working Note #100, University of Tennessee, May 1995"},{"key":"10.1016\/S0167-8191(03)00017-6_BIB7","unstructured":"M. D\u2019Apuzzo, M.L. De Cesare, M. Marino, G. Toraldo, IP Software for BCQP Problems, CPS Tech. Report TR-13-01, Center for Research on Parallel Computing and Supercomputers, CPS-CNR, 2001"},{"key":"10.1016\/S0167-8191(03)00017-6_BIB8","doi-asserted-by":"crossref","unstructured":"M. D\u2019Apuzzo, M. Marino, P.M. Pardalos, G. Toraldo, A parallel implementation of a potential reduction algorithm for box-constrained quadratic programming, in: Lecture Notes in Computer Science\u2013\u2013Euro-Par 2000, Springer-Verlag, 2000, pp. 839\u2013848","DOI":"10.1007\/3-540-44520-X_116"},{"key":"10.1016\/S0167-8191(03)00017-6_BIB9","unstructured":"J.J. Dongarra, R.C. Whaley, A User\u2019s Guide to the BLACS V 1.1, Tech. Rep. UT, CS-95-281, LAPACK Working Note # 94, University Tennessee, 1995 (Revised 1997)"},{"key":"10.1016\/S0167-8191(03)00017-6_BIB10","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1023\/A:1017523228692","article-title":"Parallel interior point method for linear and quadratic programs with special structure","volume":"110","author":"Durazzi","year":"2001","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0167-8191(03)00017-6_BIB11","unstructured":"J. Gondzio, R. Sarkissian, Parallel interior point solver for structured linear programs, Tech. Rep. MS-00-025, Department of Mathematics and Statistics, The University of Edinburgh, December 4, 2000, revised February 2, 2002"},{"key":"10.1016\/S0167-8191(03)00017-6_BIB12","doi-asserted-by":"crossref","unstructured":"W. Gropp, E. Lusk, A. Skjellum, Using MPI: Portable Parallel Programming with the Message-Passing Interface\u2013\u2013Second Edition, The MIT Press, Scientific and Engineering Computation Series, 1999","DOI":"10.7551\/mitpress\/7056.001.0001"},{"key":"10.1016\/S0167-8191(03)00017-6_BIB13","series-title":"Large-Scale Numerical Optimization","first-page":"92","article-title":"Computational aspects of an interior point algorithm for quadratic problems with box constraints","author":"Han","year":"1990"},{"key":"10.1016\/S0167-8191(03)00017-6_BIB14","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01594942","article-title":"An O(nL) iteration potential reduction algorithm for linear complementarity problems","volume":"50","author":"Kojima","year":"1991","journal-title":"Mathe. Prog."},{"issue":"4","key":"10.1016\/S0167-8191(03)00017-6_BIB15","doi-asserted-by":"crossref","first-page":"1100","DOI":"10.1137\/S1052623498345075","article-title":"Newton\u2019s method for large bound-constrained optimization problem","volume":"9","author":"Lin","year":"1999","journal-title":"SIAM J. Optim."},{"key":"10.1016\/S0167-8191(03)00017-6_BIB16","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1137\/S1064827597327334","article-title":"Incomplete Cholesky factorizations with limited memory","volume":"21","author":"Lin","year":"1999","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/S0167-8191(03)00017-6_BIB17","unstructured":"J.P. Goux, G. Liu, J.L. Morales, J. Nocedal, R. Waltz, Assessing the potential of interior methods for nonlinear optimization, Report OTC 2001\/6, Optimization Technology Center, 2001"},{"key":"10.1016\/S0167-8191(03)00017-6_BIB18","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF01396045","article-title":"Algorithms for bound constrained quadratic programming problems","volume":"55","author":"Mor\u00e9","year":"1989","journal-title":"Numerische Mathematik"},{"key":"10.1016\/S0167-8191(03)00017-6_BIB19","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1137\/0801008","article-title":"On the solution of quadratic programming problems with bound constraints","volume":"1","author":"Mor\u00e9","year":"1991","journal-title":"SIAM J. Optim."},{"key":"10.1016\/S0167-8191(03)00017-6_BIB20","series-title":"Iterative Methods for Sparse Linear Systems","author":"Saad","year":"1996"},{"key":"10.1016\/S0167-8191(03)00017-6_BIB21","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1287\/moor.15.3.508","article-title":"A centered projective algorithm for linear programming","volume":"15","author":"Todd","year":"1990","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0167-8191(03)00017-6_BIB22","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1023\/A:1008677427361","article-title":"An interior point algorithm for nonconvex nonlinear programming","volume":"13","author":"Vanderbei","year":"1999","journal-title":"Comput. Opt. Appl."},{"key":"10.1016\/S0167-8191(03)00017-6_BIB23","series-title":"Primal-Dual Interior Point Methods","author":"Wright","year":"1997"},{"issue":"1","key":"10.1016\/S0167-8191(03)00017-6_BIB24","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1137\/S1052623497322279","article-title":"Ill-conditioning and computational error in interior methods for nonlinear programming","volume":"9","author":"Wright","year":"1998","journal-title":"SIAM J. Optim."},{"key":"10.1016\/S0167-8191(03)00017-6_BIB25","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF01594937","article-title":"An O(n3L) potential reduction algorithm for linear programming","volume":"50","author":"Ye","year":"1991","journal-title":"Math. Prog."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819103000176?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819103000176?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T07:31:08Z","timestamp":1584516668000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819103000176"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0167819103000176"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(03)00017-6","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}