{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T06:39:32Z","timestamp":1690353572477},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,2,16]],"date-time":"2013-02-16T00:00:00Z","timestamp":1360972800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s12532-012-0050-3","type":"journal-article","created":{"date-parts":[[2013,2,15]],"date-time":"2013-02-15T10:41:01Z","timestamp":1360924861000},"page":"113-142","source":"Crossref","is-referenced-by-count":6,"title":["Trajectory-following methods for large-scale degenerate convex quadratic programming"],"prefix":"10.1007","volume":"5","author":[{"given":"Nicholas I. M.","family":"Gould","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Orban","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel P.","family":"Robinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,2,16]]},"reference":[{"issue":"3\u20134","key":"50_CR1","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1080\/10556789708805657","volume":"7","author":"M Anitescu","year":"1997","unstructured":"Anitescu, M., Lesaja, G., Potra, F.A.: Equivaence between different formulations of the linear complementarity problem. Optim. Methods Softw. 7(3\u20134), 265\u2013290 (1997)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"50_CR2","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1137\/0806018","volume":"6","author":"SC Billups","year":"1996","unstructured":"Billups, S.C., Ferris, M.C.: Convergence of an infeasible interior-point algorithm from arbitrary positive starting points. SIAM J. Optim. 6(2), 316\u2013325 (1996)","journal-title":"SIAM J. Optim."},{"key":"50_CR3","unstructured":"Cartis, C., Gould, N.I.M.: Finding a point in the relative interior of a polyhedron. Technical Report RAL-TR-2006-016, Rutherford Appleton Laboratory. Chilton (2006)"},{"issue":"3","key":"50_CR4","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s10589-007-9106-0","volume":"41","author":"M Colombo","year":"2008","unstructured":"Colombo, M., Gondzio, J.: Further development of multiple centrality correctors for interior point methods. Comput. Optim. Appl. 41(3), 277\u2013305 (2008)","journal-title":"Comput. Optim. Appl."},{"key":"50_CR5","doi-asserted-by":"crossref","unstructured":"Conn, A.R., Gould, N.I.M., Toint, Ph.L.: Trust-Region Methods. MPS-SIAM Series on Optimization. SIAM publications, Philadelphia (2000)","DOI":"10.1137\/1.9780898719857"},{"issue":"2","key":"50_CR6","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"2","key":"50_CR7","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1023\/A:1021768121263","volume":"102","author":"LM Gra\u00f1a Drummond","year":"1999","unstructured":"Gra\u00f1a Drummond, L.M., Svaiter, B.F.: On well definedness of the central path. J. Optim. Theory Appl. 102(2), 223\u2013237 (1999)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"50_CR8","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1145\/229473.229476","volume":"22","author":"IS Duff","year":"1996","unstructured":"Duff, I.S., Reid, J.K.: The design of MA48: a code for the direct solution of sparse unsymmetric linear systems of equations. Trans. ACM Math. Softw. 22(2), 187\u2013226 (1996)","journal-title":"Trans. ACM Math. Softw."},{"issue":"6","key":"50_CR9","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1137\/0711083","volume":"11","author":"DK Dunaway","year":"1974","unstructured":"Dunaway, D.K.: Calculation of zeros of a real polynomial through factorization using Euclid\u2019s algorithm. SIAM J. Numer. Anal. 11(6), 1087\u20131104 (1974)","journal-title":"SIAM J. Numer. Anal."},{"key":"50_CR10","volume-title":"Practical Optimization","author":"PE Gill","year":"1981","unstructured":"Gill, P.E., Murray, W., Wright, M.H.: Practical Optimization. Academic Press, London (1981)"},{"issue":"2","key":"50_CR11","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF00249643","volume":"6","author":"J Gondzio","year":"1996","unstructured":"Gondzio, J.: Multiple centrality corrections in a primal-dual method for linear programming. Comput. Optim. Appl. 6(2), 137\u2013156 (1996)","journal-title":"Comput. Optim. Appl."},{"key":"50_CR12","unstructured":"Gould, N.I.M., Orban, D., Toint, Ph.L.: $$\\sf CUTEr$$ (and $$\\sf SifDec $$ ), a constrained and unconstrained testing environment, revisited. Trans. ACM Math. Softw. 29(4), 373\u2013394 (2003)"},{"key":"50_CR13","unstructured":"Gould, N.I.M., Orban, D., Toint, Ph.L.: $$\\sf GALAHAD $$ \u2014a library of thread-safe fortran 90 packages for large-scale nonlinear optimization. Trans. ACM Math. Softw. 29(4), 353\u2013372 (2003)"},{"issue":"4","key":"50_CR14","doi-asserted-by":"crossref","first-page":"2023","DOI":"10.1137\/080744542","volume":"20","author":"NIM Gould","year":"2010","unstructured":"Gould, N.I.M., Robinson, D.P.: A second derivative SQP method: global convergence. SIAM J. Optim. 20(4), 2023\u20132048 (2010)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"50_CR15","doi-asserted-by":"crossref","first-page":"2049","DOI":"10.1137\/080744554","volume":"20","author":"NIM Gould","year":"2010","unstructured":"Gould, N.I.M., Robinson, D.P.: A second derivative SQP method: local convergence and practical issues. SIAM J. Optim. 20(4), 2049\u20132079 (2010)","journal-title":"SIAM J. Optim."},{"key":"50_CR16","unstructured":"Gould, N.I.M., Toint, Ph.L.: Preprocessing for quadratic programming. Math. Program. B 100(1), 95\u2013132 (2004)"},{"key":"50_CR17","unstructured":"Gupta, A.: WSMP: Watson sparse matrix package part I\u2014direct solution of symmetric sparse system. Research Report RC 21886. IBM T. J. Watson Research Center, Yorktown Heights (2010)"},{"key":"50_CR18","unstructured":"Hogg, J.D., Scott, J.A.: A note on the solve phase of a multicore solver. Technical Report RAL-TR-2010-007, Rutherford Appleton Laboratory, Chilton (2010)"},{"key":"50_CR19","unstructured":"HSL. A collection of Fortran codes for large-scale scientific computation (2011). http:\/\/www.hsl.rl.ac.uk"},{"issue":"1","key":"50_CR20","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF02192304","volume":"85","author":"J Ji","year":"1995","unstructured":"Ji, J., Potra, F.A., Huang, S.: Predictor\u2013corrector method for linear complementarity problems with polynomial complexity and superlinear convergence. J. Optim. Theory Appl. 85(1), 187\u2013199 (1995)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"50_CR21","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1287\/moor.15.4.662","volume":"15","author":"M Kojima","year":"1990","unstructured":"Kojima, M., Mizuno, S., Noma, T.: Limiting behavior of trajectories generated by a continuation method for monotone complementarity problems. Math. Oper. Res. 15(4), 662\u2013675 (1990)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"50_CR22","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1080\/10556780512331318038","volume":"20","author":"X Liu","year":"2005","unstructured":"Liu, X., Potra, F.A.: Predictor-corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path. Optim. Methods Softw. 20(1), 145\u2013168 (2005)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"50_CR23","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1137\/050623723","volume":"17","author":"X Liu","year":"2006","unstructured":"Liu, X., Potra, F.A.: Corrector\u2013predictor methods for sufficient linear complementarity problems in a wide neighborhood of the central path. SIAM J. Optim. 17(3), 871\u2013890 (2006)","journal-title":"SIAM J. Optim."},{"key":"50_CR24","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0024-3795(91)90275-2","volume":"152","author":"IJ Lustig","year":"1991","unstructured":"Lustig, I.J., Marsten, R.E., Shanno, D.F.: Computational experience with a primal\u2013dual interior point method for linear programming. Linear Algebra Appl. 152, 191\u2013222 (1991)","journal-title":"Linear Algebra Appl."},{"key":"50_CR25","unstructured":"Madsen, K., Reid, J.K.: Fortran subroutines for finding polynomial zeros. Technical Report AERE-R 7986, AERE Harwell Laboratory, Harwell (1975)"},{"key":"50_CR26","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1080\/10556789908805768","volume":"11\u201312","author":"I Maros","year":"1999","unstructured":"Maros, I., Meszaros, C.: A repository of convex quadratic programming problems. Optim. Methods Softw. 11\u201312, 671\u2013681 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"50_CR27","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/PL00011416","volume":"90","author":"GP McCormick","year":"2001","unstructured":"McCormick, G.P., Witzgall, C.: Logarithmic SUMT limits in convex programming. Math. Program. 90(1), 113\u2013145 (2001)","journal-title":"Math. Program."},{"key":"50_CR28","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/978-1-4613-9617-8_8","volume-title":"Progress in Mathematical Programming","author":"N Megiddo","year":"1989","unstructured":"Megiddo, N.: Pathways to the optimal set in linear programming. In: Megiddo, N. (ed.) Progress in Mathematical Programming, pp. 131\u2013158. Springer, New-York (1989)"},{"key":"50_CR29","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S Mehrotra","year":"1992","unstructured":"Mehrotra, S.: On the implementation of a primal\u2013dual interior point method. SIAM J. Optim. 2, 575\u2013601 (1992)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"50_CR30","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1287\/moor.21.2.382","volume":"21","author":"S Mizuno","year":"1996","unstructured":"Mizuno, S.: A superlinearly convergent infeasible-interior-point algorithm for geometrical LCPs without a strictly complementary condition. Math. Oper. Res. 21(2), 382\u2013400 (1996)","journal-title":"Math. Oper. Res."},{"key":"50_CR31","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1287\/moor.18.4.964","volume":"18","author":"S Mizuno","year":"1993","unstructured":"Mizuno, S., Todd, M.J., Ye, Y.: On adaptive-step primal\u2013dual interior-point algorithms for linear programming. Math. Oper. Res. 18, 964\u2013981 (1993)","journal-title":"Math. Oper. Res."},{"key":"50_CR32","unstructured":"Monteiro, R.D.C., Tsuchiya, T.: Limiting behavior of the derivatives of certain trajectories associated with a monotone horizontal linear complementarity problem. Math. Oper. Res. 21(4), 793\u2013814 (1996)"},{"issue":"2","key":"50_CR33","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s10107-003-0472-9","volume":"100","author":"FA Potra","year":"2004","unstructured":"Potra, F.A.: A superlinearly convergent predictor\u2013corrector method for degenerate LCP in a wide neighborhood of the central path with $${O}(\\sqrt{n}{L})$$ -iteration complexity. Math. Program. 100(2), 317\u2013337 (2004)","journal-title":"Math. Program."},{"issue":"1","key":"50_CR34","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1137\/060670341","volume":"19","author":"FA Potra","year":"2008","unstructured":"Potra, F.A.: Primal\u2013dual affine scaling interior point methods for linear complementarity problems. SIAM J. Optim. 19(1), 114\u2013143 (2008)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"50_CR35","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1023\/A:1022670415661","volume":"97","author":"FA Potra","year":"1998","unstructured":"Potra, F.A., Sheng, R.: Superlinearly convergent infeasible-interior-point algorithm for degenerate lcp. J. Optim. Theory Appl. 97(2), 249\u2013269 (1998)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"50_CR36","doi-asserted-by":"crossref","first-page":"1333","DOI":"10.1137\/080716979","volume":"20","author":"FA Potra","year":"2009","unstructured":"Potra, F.A., Stoer, J.: On a class of superlinearly convergent polynomial time interior point methods for sufficient LCP. SIAM J. Optim. 20(3), 1333\u20131363 (2009)","journal-title":"SIAM J. Optim."},{"key":"50_CR37","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. Electron. Trans. Numer. Anal. 23, 158\u2013179 (2006)","journal-title":"Electron. Trans. Numer. Anal."},{"key":"50_CR38","unstructured":"Siegel, C.L.: Topics in Complex Function Theory. Elliptic Functions and Uniformization Theory, vol. 1. Wiley, Chichester (1988)"},{"key":"50_CR39","unstructured":"Stoer, J.: High order long-step methods for solving linear complemenarity problems. Ann. Oper. Res. 103 (2001)"},{"key":"50_CR40","doi-asserted-by":"crossref","unstructured":"Stoer, J.: Analysis of interior-point paths. J. Res. Natl. Inst. Stand. Technol. 111(2) (2006)","DOI":"10.6028\/jres.111.013"},{"issue":"2","key":"50_CR41","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1080\/10556789808805721","volume":"10","author":"J Stoer","year":"1998","unstructured":"Stoer, J., Wechs, M.: The complexity of high-order predictor-corrector methods for solving sufficient linear complementarity problems. Optim. Methods Softw. 10(2), 393\u2013417 (1998)","journal-title":"Optim. Methods Softw."},{"issue":"1\u20133","key":"50_CR42","first-page":"407","volume":"83","author":"J Stoer","year":"1998","unstructured":"Stoer, J., Wechs, M.: Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity. Math. Program. 83(1\u20133), 407\u2013423 (1998)","journal-title":"Math. Program."},{"key":"50_CR43","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1007\/s002110050407","volume":"81","author":"J Stoer","year":"1999","unstructured":"Stoer, J., Wechs, M.: On the analyticity properties of infeasible-interior-point paths for monotone linear complementarity problems. Numer. Math. 81, 631\u2013645 (1999)","journal-title":"Numer. Math."},{"issue":"4","key":"50_CR44","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1287\/moor.23.4.832","volume":"23","author":"J Stoer","year":"1998","unstructured":"Stoer, J., Wechs, M., Mizuno, S.: High order infeasible-interior-point methods for solving sufficient linear complementarity problems. Math. Oper. Res. 23(4), 832\u2013862 (1998)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"50_CR45","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1287\/moor.24.1.72","volume":"24","author":"JF Sturm","year":"1999","unstructured":"Sturm, J.F.: Superlinear convergence of an algorithm for monotone linear complementarity problems, when no strictly complementary solution exists. Math. Oper. Res. 24(1), 72\u201394 (1999)","journal-title":"Math. Oper. Res."},{"key":"50_CR46","first-page":"103","volume":"239","author":"H V\u00e4liaho","year":"1996","unstructured":"V\u00e4liaho, H.: $$P_*$$ -matrices are just sufficient. Linear Algebra Appl. 239, 103\u2013108 (1996)","journal-title":"Linear Algebra Appl."},{"key":"50_CR47","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1017\/S0962492900002300","volume":"1","author":"MH Wright","year":"1992","unstructured":"Wright, M.H.: Interior methods for constrained optimization. Acta Numer. 1, 341\u2013407 (1992)","journal-title":"Acta Numer."},{"key":"50_CR48","doi-asserted-by":"crossref","unstructured":"Wright, S.J.: Primal\u2013Dual Interior-Point Methods. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1997)","DOI":"10.1137\/1.9781611971453"},{"issue":"3","key":"50_CR49","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1287\/moor.27.3.585.312","volume":"27","author":"SJ Wright","year":"2002","unstructured":"Wright, S.J., Orban, D.: Local convergence of the Newton\/log-barrier method for degenerate problems. Math. Oper. Res. 27(3), 585\u2013613 (2002)","journal-title":"Math. Oper. Res."},{"key":"50_CR50","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF01581242","volume":"59","author":"Y Ye","year":"1993","unstructured":"Ye, Y., G\u00fcler, O., Tapia, R.A., Zhang, Y.: A quadratically convergent $${O}(\\sqrt{n}{L})$$ -iteration algorithm for linear programming. Math. Program. 59, 151\u2013162 (1993)","journal-title":"Math. Program."},{"issue":"1","key":"50_CR51","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1137\/0804012","volume":"4","author":"Y Zhang","year":"1994","unstructured":"Zhang, Y.: On the convergence of a class of infeasible interior-point methods for the horizontal linear complementarity problem. SIAM J. Optim. 4(1), 208\u2013227 (1994)","journal-title":"SIAM J. Optim."},{"key":"50_CR52","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF01585769","volume":"68","author":"Y Zhang","year":"1995","unstructured":"Zhang, Y., Zhang, D.: On polynomiality of the Mehrotra-type predictor\u2013corrector interior-point algorithms. Math. Program. 68, 303\u2013318 (1995)","journal-title":"Math. Program."},{"issue":"3","key":"50_CR53","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1023\/A:1026492106091","volume":"14","author":"G Zhao","year":"1999","unstructured":"Zhao, G., Sun, J.: On the rate of local convergence of high-order-infeasible-path- following algorithms for $$P_*$$ -linear complementarity problems. Comput. Optim. Appl. 14(3), 293\u2013307 (1999)","journal-title":"Comput. Optim. Appl."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-012-0050-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-012-0050-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-012-0050-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T12:15:57Z","timestamp":1559477757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-012-0050-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,16]]},"references-count":53,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["50"],"URL":"https:\/\/doi.org\/10.1007\/s12532-012-0050-3","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,16]]}}}