{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T02:07:05Z","timestamp":1773022025601,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,7,25]],"date-time":"2014-07-25T00:00:00Z","timestamp":1406246400000},"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":["Comput Optim Appl"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s10589-014-9681-9","type":"journal-article","created":{"date-parts":[[2014,7,24]],"date-time":"2014-07-24T11:53:26Z","timestamp":1406202806000},"page":"311-341","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization"],"prefix":"10.1007","volume":"60","author":[{"given":"Frank E.","family":"Curtis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zheng","family":"Han","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":[[2014,7,25]]},"reference":[{"issue":"3","key":"9681_CR1","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF02612339","volume":"28","author":"M Aganagi\u0107","year":"1984","unstructured":"Aganagi\u0107, M.: Newton\u2019s method for linear complementarity problems. Math. Program. 28(3), 349\u2013362 (1984)","journal-title":"Math. Program."},{"issue":"4","key":"9681_CR2","doi-asserted-by":"crossref","first-page":"1176","DOI":"10.1137\/S0363012997328609","volume":"37","author":"M Bergounioux","year":"1999","unstructured":"Bergounioux, M., Ito, K., Kunisch, K.: Primal-dual strategy for constrained optimal control problems. SIAM J. Control Optim. 37(4), 1176\u20131194 (1999)","journal-title":"SIAM J. Control Optim."},{"issue":"2","key":"9681_CR3","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1023\/A:1015489608037","volume":"22","author":"M Bergounioux","year":"2002","unstructured":"Bergounioux, M., Kunisch, K.: Primal-dual strategy for state-constrained optimal control problems. Comput. Optim. Appl. 22(2), 193\u2013224 (2002)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"9681_CR4","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s10107-009-0264-y","volume":"125","author":"EG Birgin","year":"2010","unstructured":"Birgin, E.G., Floudas, C.A., Mart\u00ednez, J.M.: Global minimization using an augmented Lagrangian method with variable lower-level constraints. Math. Program. 125(1), 139\u2013162 (2010)","journal-title":"Math. Program."},{"key":"9681_CR5","unstructured":"Byrd, R.H., Chin, G.M., Nocedal, J., Oztoprak, F.: A family of second-order methods for convex $$\\ell _1$$ \u2113 1 -regularized optimization. Technical report, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL (2012)"},{"issue":"2","key":"9681_CR6","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1137\/040605904","volume":"17","author":"L Chen","year":"2006","unstructured":"Chen, L., Wang, Y., He, G.: A feasible active set QP-free method for nonlinear programming. SIAM J. Optim. 17(2), 401\u2013429 (2006)","journal-title":"SIAM J. Optim."},{"key":"9681_CR7","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719208","volume-title":"The Finite Element Method for Elliptic Problems. Classics in Applied Mathematics","author":"PG Ciarlet","year":"2002","unstructured":"Ciarlet, P.G.: The Finite Element Method for Elliptic Problems. Classics in Applied Mathematics. Society for Industrial and Applied Mathematics, Philadelphia, PA (2002)"},{"key":"9681_CR8","unstructured":"Conn, A.R., Gould, N.I.M., Toint, PhL: A globally convergent augmented lagrangian algorithm for optimization with general constraints and simple bounds. SIAM J. Numer. Anal. 28(2), 545\u2013572 (1991)"},{"key":"9681_CR9","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719857","volume-title":"Trust-Region Methods","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, PhL: Trust-Region Methods. Society for Industrial and Applied Mathematics, Philadelphia, PA (2000)"},{"issue":"3","key":"9681_CR10","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1137\/0309028","volume":"9","author":"CW Cryer","year":"1971","unstructured":"Cryer, C.W.: The solution of a quadratic programming problem using systematic overrelaxation. SIAM J. Control 9(3), 385\u2013392 (1971)","journal-title":"SIAM J. Control"},{"issue":"4\u20135","key":"9681_CR11","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1080\/10556788.2010.514341","volume":"26","author":"L Feng","year":"2011","unstructured":"Feng, L., Linetsky, V., Morales, J.L., Nocedal, J.: On the solution of complementarity problems arising in American options pricing. Optim. Method. Softw. 26(4\u20135), 813\u2013825 (2011)","journal-title":"Optim. Method. Softw."},{"key":"9681_CR12","doi-asserted-by":"crossref","unstructured":"Ferreau, H.J., Kirches, C., Potschka, A., Bock, H.G., Diehl, M.: qpOASES: a parametric active-set algorithm for quadratic programming. Math. Program. Comput., 1\u201337 (2014)","DOI":"10.1007\/s12532-014-0071-1"},{"issue":"2","key":"9681_CR13","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s10107-010-0439-6","volume":"134","author":"IB Gharbia","year":"2012","unstructured":"Gharbia, I.B., Gilbert, J.C.: Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P-matrix. Math. Program. 134(2), 349\u2013364 (2012)","journal-title":"Math. Program."},{"issue":"1","key":"9681_CR14","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1137\/S0036144504446096","volume":"47","author":"PE Gill","year":"2005","unstructured":"Gill, P.E., Murray, W., Saunders, M.A.: SNOPT: an SQP algorithm for large-scale constrained optimization. SIAM Rev. 47(1), 99\u2013131 (2005)","journal-title":"SIAM Rev."},{"key":"9681_CR15","unstructured":"Gill, P.E., Murray, W., Saunders, M.A.: User\u2019s guide for SQOPT version 7: software for largescale linear and quadratic programming. Systems Optimization Laboratory, Stanford University, Palo Alto, CA (2006)"},{"key":"9681_CR16","volume-title":"Practical Optimization","author":"PE Gill","year":"1982","unstructured":"Gill, P.E., Murray, W., Wright, M.H.: Practical Optimization. Emerald Group Publishing Limited, Bingley (1982)"},{"key":"9681_CR17","unstructured":"Gill, P.E., Robinson, D.P.: Regularized sequential quadratic programming methods. Technical report, Department of Mathematics, University of California, San Diego, La Jolla, CA (2011)"},{"issue":"4","key":"9681_CR18","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":"9681_CR19","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."},{"issue":"2","key":"9681_CR20","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1093\/imanum\/drq043","volume":"32","author":"NIM Gould","year":"2011","unstructured":"Gould, N.I.M., Robinson, D.P.: A second-derivative SQP method with a \u201ctrust-region-free\u201d predictor step. IMA J. Numer. Anal. 32(2), 580\u2013601 (2011)","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"9681_CR21","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0168-9274(02)00120-4","volume":"43","author":"NIM Gould","year":"2002","unstructured":"Gould, N.I.M., Toint, PhL: An iterative working-set method for large-scale nonconvex quadratic programming. Appl. Numer. Math. 43(1), 109\u2013128 (2002)","journal-title":"Appl. Numer. Math."},{"issue":"4","key":"9681_CR22","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A nonmonotone line search technique for Newton\u2019s method. SIAM J. Numer. Anal. 23(4), 707\u2013716 (1986)","journal-title":"SIAM J. Numer. Anal."},{"key":"9681_CR23","first-page":"137","volume-title":"Advances in Optimization and Parallel Computing","author":"WW Hager","year":"1992","unstructured":"Hager, W.W.: The dual active set algorithm. In: Pardalos, P.M. (ed.) Advances in Optimization and Parallel Computing, pp. 137\u2013142. North Holland, Amsterdam (1992)"},{"issue":"4","key":"9681_CR24","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF00248762","volume":"1","author":"WW Hager","year":"1993","unstructured":"Hager, W.W., Hearn, D.W.: Application of the dual active set algorithm to quadratic network optimization. Comput. Optim. Appl. 1(4), 349\u2013373 (1993)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"9681_CR25","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1137\/S1052623401383558","volume":"13","author":"M Hinterm\u00fcller","year":"2003","unstructured":"Hinterm\u00fcller, M., Ito, K., Kunisch, K.: The primal-dual active set strategy as a semismooth Newton method. SIAM J. Optim. 13(3), 865\u2013888 (2003)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"9681_CR26","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0024-3795(78)90083-6","volume":"21","author":"MM Kostreva","year":"1978","unstructured":"Kostreva, M.M.: Block pivot methods for solving the complementarity problem. Linear Algebra Appl. 21(3), 207\u2013215 (1978)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"9681_CR27","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s002110050050","volume":"68","author":"M Ko\u010dvara","year":"1994","unstructured":"Ko\u010dvara, M., Zowe, J.: An iterative two-step algorithm for linear complementarity problems. Numerische Mathematik 68(1), 95\u2013106 (1994)","journal-title":"Numerische Mathematik"},{"issue":"1","key":"9681_CR28","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1137\/S1052623400376135","volume":"14","author":"K Kunisch","year":"2003","unstructured":"Kunisch, K., Rendl, F.: An infeasible active set method for quadratic problems with simple bounds. SIAM J. Optim. 14(1), 35\u201352 (2003)","journal-title":"SIAM J. Optim."},{"issue":"1\u20134","key":"9681_CR29","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1080\/10556789908805768","volume":"11","author":"I Maros","year":"1999","unstructured":"Maros, I., M\u00e9sz\u00e1ros, C.: A repository of convex quadratic programming problems. Optim. Method. Softw. 11(1\u20134), 671\u2013681 (1999)","journal-title":"Optim. Method. Softw."},{"issue":"1","key":"9681_CR30","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1137\/0801008","volume":"1","author":"J Mor\u00e9","year":"1991","unstructured":"Mor\u00e9, 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":"9681_CR31","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization 2nd edn. Springer Series in Operations Research and Financial Engineering. Springer, New York (2006)"},{"issue":"208","key":"9681_CR32","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1090\/S0025-5718-1994-1250776-4","volume":"63","author":"LF Portugal","year":"1994","unstructured":"Portugal, L.F., J\u00fadice, J.J., Vicente, L.N.: A comparison of block pivoting and interior-point algorithms for linear least squares problems with nonnegative variables. Math. Comput. 63(208), 625\u2013643 (1994)","journal-title":"Math. Comput."},{"issue":"3","key":"9681_CR33","doi-asserted-by":"crossref","first-page":"1371","DOI":"10.1137\/110845094","volume":"23","author":"DP Robinson","year":"2013","unstructured":"Robinson, D.P., Feng, L., Nocedal, J., Pang, J.S.: Subspace accelerated matrix splitting algorithms for asymmetric and symmetric linear complementarity problems. SIAM J. Optim. 23(3), 1371\u20131397 (2013)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"9681_CR34","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF02614518","volume":"77","author":"PhL Toint","year":"1997","unstructured":"Toint, PhL: Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints. Math. Program. 77(3), 69\u201394 (1997)","journal-title":"Math. Program."},{"issue":"1","key":"9681_CR35","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s10107-002-0343-9","volume":"95","author":"M Ulbrich","year":"2003","unstructured":"Ulbrich, M., Ulbrich, S.: Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function. Math. Program. 95(1), 103\u2013135 (2003)","journal-title":"Math. Program."},{"issue":"3","key":"9681_CR36","first-page":"273","volume":"20","author":"V Vapnik","year":"1995","unstructured":"Vapnik, V., Cortes, C.: Support vector networks. Mach. Learn. 20(3), 273\u2013297 (1995)","journal-title":"Mach. Learn."},{"issue":"389","key":"9681_CR37","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1080\/01621459.1985.10477119","volume":"80","author":"Y Vardi","year":"1985","unstructured":"Vardi, Y., Shepp, L.A., Kaufman, L.: A statistical model for positron emission tomography. J. Am. Statist. Assoc. 80(389), 8\u201320 (1985)","journal-title":"J. Am. Statist. Assoc."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-014-9681-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-014-9681-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-014-9681-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T04:16:29Z","timestamp":1565669789000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-014-9681-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,25]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["9681"],"URL":"https:\/\/doi.org\/10.1007\/s10589-014-9681-9","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,25]]}}}