{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T18:03:35Z","timestamp":1761156215462,"version":"3.37.3"},"reference-count":77,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T00:00:00Z","timestamp":1480550400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/I013067\/1"],"award-info":[{"award-number":["EP\/I013067\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s10589-016-9886-1","type":"journal-article","created":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T10:52:35Z","timestamp":1480589555000},"page":"1-38","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A dual gradient-projection method for large-scale strictly convex quadratic problems"],"prefix":"10.1007","volume":"67","author":[{"given":"Nicholas I. M.","family":"Gould","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0251-4227","authenticated-orcid":false,"given":"Daniel P.","family":"Robinson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,1]]},"reference":[{"issue":"4","key":"9886_CR1","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/BF00935003","volume":"43","author":"M Arioli","year":"1984","unstructured":"Arioli, M., Laratta, A., Menchi, O.: Numerical computation of the projection of a point onto a polyhedron. J. Optim. Theory Appl. 43(4), 495\u2013525 (1984)","journal-title":"J. Optim. Theory Appl."},{"doi-asserted-by":"crossref","unstructured":"Axehill, D. Hansson, A.: A dual gradient projection quadratic programming algorithm tailored for model predictive control. In: Proceedings of the 47th IEEE Conference on Decision and Control, pp. 3057\u20133064, Cancun (2008)","key":"9886_CR2","DOI":"10.1109\/CDC.2008.4738961"},{"issue":"1","key":"9886_CR3","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s11081-006-6588-z","volume":"7","author":"RA Bartlett","year":"2006","unstructured":"Bartlett, R.A., Biegler, L.T.: QPSchur: a dual, active-set, Schur-complement method for large-scale and structured convex quadratic programming. Optim. Eng. 7(1), 5\u201332 (2006)","journal-title":"Optim. Eng."},{"key":"9886_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0962492904000212","volume":"14","author":"M Benzi","year":"2005","unstructured":"Benzi, M., Golub, G.H., Liesen, J.: Numerical solution of saddle point problems. Acta Numer. 14, 1\u2013137 (2005)","journal-title":"Acta Numer."},{"key":"9886_CR5","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1007\/BF02192216","volume":"82","author":"JT Betts","year":"1994","unstructured":"Betts, J.T., Frank, P.D.: A sparse nonlinear optimization algorithm. J. Optim. Theory Appl. 82, 519\u2013541 (1994)","journal-title":"J. Optim. Theory Appl."},{"key":"9886_CR6","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0024-3795(91)90009-L","volume":"143","author":"M Bierlaire","year":"1991","unstructured":"Bierlaire, M., Toint, P.L., Tuyttens, D.: On iterative algorithms for linear least squares problems with bound constraints. Linear Algebra Appl. 143, 111\u2013143 (1991)","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"9886_CR7","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01584341","volume":"13","author":"J Bisschop","year":"1977","unstructured":"Bisschop, J., Meeraus, A.: Matrix augmentation and partitioning in the updating of the basis inverse. Math. Program. 13(3), 241\u2013254 (1977)","journal-title":"Math. Program."},{"key":"9886_CR8","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971484","volume-title":"Numerical Methods for Least Squares Problems","author":"\u00c5 Bj\u00f6rck","year":"1996","unstructured":"Bj\u00f6rck, \u00c5.: Numerical Methods for Least Squares Problems. SIAM, Philadelphia (1996)"},{"key":"9886_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0962492900002518","volume":"4","author":"PT Boggs","year":"1995","unstructured":"Boggs, P.T., Tolle, J.W.: Sequential quadratic programming. Acta Numer. 4, 1\u201351 (1995)","journal-title":"Acta Numer."},{"issue":"1","key":"9886_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02614503","volume":"78","author":"NL Boland","year":"1997","unstructured":"Boland, N.L.: A dual-active-set algorithm for positive semi-definite quadratic programming. Math. Program. Ser. A 78(1), 1\u201327 (1997)","journal-title":"Math. Program. Ser. A"},{"issue":"2","key":"9886_CR11","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01582063","volume":"63","author":"RH Byrd","year":"1994","unstructured":"Byrd, R.H., Nocedal, J., Schnabel, R.B.: Representations of quasi-Newton matrices and their use in limited memory methods. Math. Program. 63(2), 129\u2013156 (1994)","journal-title":"Math. Program."},{"issue":"1","key":"9886_CR12","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF02592073","volume":"39","author":"PH Calamai","year":"1987","unstructured":"Calamai, P.H., Mor\u00e9, J.J.: Projected gradient methods for linearly constrained problems. Math. Program. 39(1), 93\u2013116 (1987)","journal-title":"Math. Program."},{"issue":"6","key":"9886_CR13","first-page":"302","volume":"21","author":"AR Conn","year":"1984","unstructured":"Conn, A.R., Gould, N.I.M.: On the location of directions of infinite descent for nonlinear programming algorithms. SIAM J. Numer. Anal. 21(6), 302\u2013325 (1984)","journal-title":"SIAM J. Numer. Anal."},{"unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Global convergence of a class of trust region algorithms for optimization with simple bounds. SIAM J. Numer. Anal. 25(2), 433\u2013460 (1988). See also same journal 26, 764\u2013767 (1989)","key":"9886_CR14"},{"key":"9886_CR15","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1090\/S0025-5718-1988-0929544-3","volume":"50","author":"AR Conn","year":"1988","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Testing a class of methods for solving minimization problems with simple bounds on the variables. Math. Comput. 50, 399\u2013430 (1988)","journal-title":"Math. Comput."},{"key":"9886_CR16","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, P.L.: Trust-Region Methods. SIAM, Philadelphia (2000)"},{"unstructured":"Curtis, F.E., Han, Z.: Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves. Technical Report 14T-010, COR@L Laboratory, Department of ISE, Lehigh University, 2014. In second review for SIAM Journal on Optimization","key":"9886_CR17"},{"doi-asserted-by":"publisher","unstructured":"Curtis, F.E., Han, Z., Robinson, D.P.: A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization. Comput. Optim. Appl. (2014). doi: 10.1007\/s10589-014-9681-9","key":"9886_CR18","DOI":"10.1007\/s10589-014-9681-9"},{"issue":"3","key":"9886_CR19","doi-asserted-by":"crossref","first-page":"1041","DOI":"10.1137\/130918320","volume":"24","author":"FE Curtis","year":"2014","unstructured":"Curtis, F.E., Johnson, T.C., Robinson, D.P., Wachter, A.: An inexact sequential quadratic optimization algorithm for nonlinear optimization. SIAM J. Optim. 24(3), 1041\u20131074 (2014)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9886_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11075-006-9019-5","volume":"42","author":"J Dominguez","year":"2006","unstructured":"Dominguez, J., Gonz\u00e1lez-Lima, M.D.: A primal-dual interior-point algorithm for quadratic programming. Numer. Algorithms 42(1), 1\u201330 (2006)","journal-title":"Numer. Algorithms"},{"key":"9886_CR21","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1090\/qam\/112751","volume":"18","author":"W Dorn","year":"1960","unstructured":"Dorn, W.: Duality in quadratic programming. Q. Appl. Math. 18, 155\u2013162 (1960)","journal-title":"Q. Appl. Math."},{"key":"9886_CR22","series-title":"Springer Optimization and Its Applications","volume-title":"Optimal Quadratic Programming Algorithms: With Applications to Variational Inequalities","author":"Z Dost\u00e1l","year":"2009","unstructured":"Dost\u00e1l, Z.: Optimal Quadratic Programming Algorithms: With Applications to Variational Inequalities. Springer Optimization and Its Applications, vol. 23. Springer, New York (2009)"},{"issue":"1","key":"9886_CR23","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10589-005-4557-7","volume":"30","author":"Z Dost\u00e1l","year":"2005","unstructured":"Dost\u00e1l, Z., Sch\u00f6berl, J.: Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination. Comput. Optim. Appl. 30(1), 23\u201343 (2005)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"9886_CR24","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1145\/992200.992202","volume":"30","author":"IS Duff","year":"2004","unstructured":"Duff, I.S.: MA57\u2014a code for the solution of sparse symmetric definite and indefinite systems. ACM Trans. Math. Softw. 30(2), 118\u2013144 (2004)","journal-title":"ACM Trans. Math. Softw."},{"issue":"3","key":"9886_CR25","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1145\/356044.356047","volume":"9","author":"IS Duff","year":"1983","unstructured":"Duff, I.S., Reid, J.K.: The multifrontal solution of indefinite sparse symmetric linear equations. ACM Trans. Math. Softw. 9(3), 302\u2013325 (1983)","journal-title":"ACM Trans. Math. Softw."},{"key":"9886_CR26","first-page":"26","volume-title":"Numerical Optimization 1984","author":"R Fletcher","year":"1985","unstructured":"Fletcher, R.: An $$\\ell _1$$ \u2113 1 penalty method for nonlinear constraints. In: Boggs, P.T., Byrd, R.H., Schnabel, R.B. (eds.) Numerical Optimization 1984, pp. 26\u201340. SIAM, Philadelphia (1985)"},{"doi-asserted-by":"crossref","unstructured":"Forsgren, A., Gill, P.E., Wong, E.: Primal and dual active-set methods for convex quadratic programming. Math. Program. 159(1), 469\u2013508 (2016)","key":"9886_CR27","DOI":"10.1007\/s10107-015-0966-2"},{"unstructured":"Friedlander, M.P., Gould, N.I.M., Leyffer, S., Munson, T.: A filter active-set trust-region method. Technical Report Preprint ANL\/MCS-P1456-0907, Argonne National Laboratory, Illinois (2007)","key":"9886_CR28"},{"issue":"4","key":"9886_CR29","doi-asserted-by":"crossref","first-page":"1706","DOI":"10.1137\/060669930","volume":"30","author":"MP Friedlander","year":"2008","unstructured":"Friedlander, M.P., Leyffer, S.: Global and finite termination of a two-phase augmented Lagrangian filter method for general quadratic programs. SIAM J. Sci. Comput. 30(4), 1706\u20131729 (2008)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"9886_CR30","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s12532-012-0035-2","volume":"4","author":"MP Friedlander","year":"2012","unstructured":"Friedlander, M.P., Orban, D.: A primal-dual regularized interior-point method for convex quadratic programs. Math. Program. Comput. 4(1), 71\u2013107 (2012)","journal-title":"Math. Program. Comput."},{"key":"9886_CR31","volume-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"A George","year":"1981","unstructured":"George, A., Liu, J.W.H.: Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, Englewood Cliffs (1981)"},{"key":"9886_CR32","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1093\/oso\/9780198535645.003.0008","volume-title":"Reliable Scientific Computation","author":"PE Gill","year":"1990","unstructured":"Gill, P.E., Murray, W., Saunders, M.A., Wright, M.H.: A Schur-complement method for sparse quadratic programming. In: Cox, M.G., Hammarling, S.J. (eds.) Reliable Scientific Computation, pp. 113\u2013138. Oxford University Press, Oxford (1990)"},{"issue":"1","key":"9886_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/1033001","volume":"33","author":"PE Gill","year":"1991","unstructured":"Gill, P.E., Murray, W., Saunders, M.A., Wright, M.H.: Inertia-controlling methods for general quadratic programming. SIAM Rev. 33(1), 1\u201336 (1991)","journal-title":"SIAM Rev."},{"unstructured":"Gill, P.E., Murray, W., Saunders, M.A.: User\u2019s guide for QPOPT 1.0: a Fortran package for quadratic programming. Report SOL 95-4, Department of Operations Research, Stanford University, Stanford (1995)","key":"9886_CR34"},{"key":"9886_CR35","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1093\/oso\/9780198535645.003.0008","volume-title":"Reliable Numerical Computation","author":"PE Gill","year":"1990","unstructured":"Gill, P.E., Murray, W., Saunders, M\u00a0.A., Wright, M\u00a0.H.: A Schur-complement method for sparse quadratic programming. In: Cox, M\u00a0.G., Hammarling, S\u00a0.J. (eds.) Reliable Numerical Computation, pp. 113\u2013138. Oxford University Press, Oxford (1990)"},{"issue":"1","key":"9886_CR36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02591962","volume":"27","author":"D Goldfarb","year":"1983","unstructured":"Goldfarb, D., Idnani, A.: A numerically stable dual method for solving strictly convex quadratic programs. Math. Program. 27(1), 1\u201333 (1983)","journal-title":"Math. Program."},{"issue":"2","key":"9886_CR37","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s12532-012-0050-3","volume":"5","author":"NIM Gould","year":"2013","unstructured":"Gould, N.I.M., Orban, D., Robinson, D.P.: Trajectory-following methods for large-scale degenerate convex quadratic programming. Math. Program. Comput. 5(2), 113\u2013142 (2013)","journal-title":"Math. Program. Comput."},{"issue":"4","key":"9886_CR38","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1145\/962437.962438","volume":"29","author":"NIM Gould","year":"2003","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: GALAHAD\u2014a library of thread-safe fortran 90 packages for large-scale nonlinear optimization. ACM Trans. Math. Softw. 29(4), 353\u2013372 (2003)","journal-title":"ACM Trans. Math. Softw."},{"issue":"3","key":"9886_CR39","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s10589-014-9687-3","volume":"60","author":"NIM Gould","year":"2015","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization. Comput. Optim. Appl. 60(3), 545\u2013557 (2015)","journal-title":"Comput. Optim. Appl."},{"unstructured":"Gould, N.I.M., Toint, P.L.: A quadratic programming bibliography. Numerical Analysis Group Internal Report 2000-1, Rutherford Appleton Laboratory, Chilton, Oxfordshire, England, 2000. See http:\/\/www.numerical.rl.ac.uk\/qp\/qp.html","key":"9886_CR40"},{"key":"9886_CR41","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/978-0-387-35514-6_7","volume-title":"System Modelling and Optimization. Methods, Theory and Applications","author":"NIM Gould","year":"2000","unstructured":"Gould, N.I.M., Toint, P.L.: SQP methods for large-scale nonlinear programming. In: Powell, M.J.D., Scholtes, S. (eds.) System Modelling and Optimization. Methods, Theory and Applications, pp. 149\u2013178. Kluwer Academic Publishers, Dordrecht (2000)"},{"issue":"1\u20132","key":"9886_CR42","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, P.L.: An iterative working-set method for large-scale non-convex quadratic programming. Appl. Numer. Math. 43(1\u20132), 109\u2013128 (2002)","journal-title":"Appl. Numer. Math."},{"key":"9886_CR43","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/978-1-4613-0263-6_8","volume-title":"Trends in Industrial and Applied Mathematics","author":"NIM Gould","year":"2002","unstructured":"Gould, N.I.M., Toint, P.L.: Numerical methods for large-scale non-convex quadratic programming. In: Siddiqi, A.H., Ko\u010dvara, M. (eds.) Trends in Industrial and Applied Mathematics, pp. 149\u2013179. Kluwer Academic Publishers, Dordrecht (2002)"},{"issue":"1","key":"9886_CR44","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1137\/130920599","volume":"24","author":"NIM Gould","year":"2014","unstructured":"Gould, N.I.M., Loh, Y., Robinson, D.P.: A filter method with unified step computation for nonlinear optimization. SIAM J. Optim. 24(1), 175\u2013209 (2014)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"9886_CR45","doi-asserted-by":"crossref","first-page":"1885","DOI":"10.1137\/140996677","volume":"25","author":"NIM Gould","year":"2015","unstructured":"Gould, N.I.M., Loh, Y., Robinson, D.P.: A filter SQP method: local convergence and numerical results. SIAM J. Optim. 25(3), 1885\u20131911 (2015)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"9886_CR46","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":"9886_CR47","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":"9886_CR48","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1093\/imanum\/drq043","volume":"32","author":"NIM Gould","year":"2012","unstructured":"Gould, N.I.M., Robinson, D.P.: A second derivative SQP method with a \u2018trust-region-free\u2019 predictor step. IMA J. Numer. Anal. 32(2), 580\u2013601 (2012)","journal-title":"IMA J. Numer. Anal."},{"unstructured":"Gu, Z., Rothberg, E., Bixby, R.: Gurobi Optimizer, version 5.5. 0. Software program (2013)","key":"9886_CR49"},{"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":"9886_CR50"},{"issue":"4","key":"9886_CR51","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":"9886_CR52","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1137\/S1052623401383558","volume":"13","author":"M Hinterm\u00fcller","year":"2002","unstructured":"Hinterm\u00fcller, M., Kunisch, K.: The primal-dual active set strategy as a semismooth Newton method. SIAM J. Optim. 13(3), 865\u2013888 (2002). (electronic) (2003)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"9886_CR53","first-page":"36273649","volume":"32","author":"JD Hogg","year":"2010","unstructured":"Hogg, J.D., Reid, J.K., Scott, J.A.: Design of a multicore sparse Cholesky factorization using DAGs. SIAM J. Sci. Comput. 32(6), 36273649 (2010)","journal-title":"SIAM J. Sci. Comput."},{"unstructured":"Hogg, J.D., Scott, J.A.: An indefinite sparse direct solver for large problems on multicore machines. Technical Report RAL-TR-2010-011, Rutherford Appleton Laboratory, Chilton (2010)","key":"9886_CR54"},{"unstructured":"Hogg, J.D., Scott, J.A.: HSL_MA97: a bit-compatible multifrontal code for sparse symmetric systems. Technical Report RAL-TR-2011-024, Rutherford Appleton Laboratory, Chilton (2011)","key":"9886_CR55"},{"unstructured":"ILOG CPLEX. High-performance software for mathematical programming and optimization (2005)","key":"9886_CR56"},{"key":"9886_CR57","volume-title":"The Theory of Matrices: With Applications","author":"P Lancaster","year":"1985","unstructured":"Lancaster, P., Tismenetsky, M.: The Theory of Matrices: With Applications, 2nd edn. Academic Press, London (1985)","edition":"2"},{"issue":"2","key":"9886_CR58","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1137\/0728026","volume":"28","author":"M Lescrenier","year":"1991","unstructured":"Lescrenier, M.: Convergence of trust region algorithms for optimization with bounds when strict complementarity does not hold. SIAM J. Numer. Anal. 28(2), 476\u2013495 (1991)","journal-title":"SIAM J. Numer. Anal."},{"key":"9886_CR59","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\u20134","key":"9886_CR60","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1080\/10556789908805758","volume":"11","author":"C M\u00e9sz\u00e1ros","year":"1999","unstructured":"M\u00e9sz\u00e1ros, C.: The BPMPD interior point solver for convex quadratic problems. Optim. Methods Softw. 11(1\u20134), 431\u2013449 (1999)","journal-title":"Optim. Methods Softw."},{"key":"9886_CR61","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1093\/imanum\/drq037","volume":"32","author":"JL Morales","year":"2012","unstructured":"Morales, J.L., Nocedal, J., Wu, Y.: A sequential quadratic programming algorithm with an additional equality constrained phase. IMA J. Numer. Anal. 32, 553\u2013579 (2012)","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"9886_CR62","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1137\/0801008","volume":"1","author":"JJ 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."},{"issue":"3","key":"9886_CR63","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1145\/192115.192132","volume":"20","author":"JJ Mor\u00e9","year":"1994","unstructured":"Mor\u00e9, J.J., Thuente, D.J.: Line search algorithms with guaranteed sufficient decrease. ACM Trans. Math. Softw. 20(3), 286\u2013307 (1994)","journal-title":"ACM Trans. Math. Softw."},{"issue":"4","key":"9886_CR64","doi-asserted-by":"crossref","first-page":"2385","DOI":"10.1137\/15M1022100","volume":"25","author":"H Moyh-ud Din","year":"2015","unstructured":"Moyh-ud Din, H., Robinson, D.P.: A solver for nonconvex bound-constrained quadratic optimization. SIAM J. Optim. 25(4), 2385\u20132407 (2015)","journal-title":"SIAM J. Optim."},{"key":"9886_CR65","series-title":"Series in Operations Research","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Series in Operations Research, 2nd edn. Springer, Heidelberg (2006)","edition":"2"},{"doi-asserted-by":"publisher","unstructured":"Polyak, R.A., Costa, J., Neyshabouri, S.: Dual fast projected gradient method for quadratic programming. Optim. Lett. (2012). doi: 10.1007\/s11590-012-0476-6","key":"9886_CR66","DOI":"10.1007\/s11590-012-0476-6"},{"unstructured":"Powell, M.J.D.: ZQPCVX a FORTRAN subroutine for convex quadratic programming. University, Department of Applied Mathematics and Theoretical Physics (1983)","key":"9886_CR67"},{"issue":"2","key":"9886_CR68","first-page":"9","volume":"36","author":"JK Reid","year":"2009","unstructured":"Reid, J.K., Scott, J.A.: An out-of-core sparse Cholesky solver. ACM Trans. Math. Softw. 36(2), 9 (2009)","journal-title":"ACM Trans. Math. Softw."},{"issue":"3","key":"9886_CR69","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."},{"key":"9886_CR70","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."},{"issue":"9","key":"9886_CR71","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1016\/0098-1354(94)E0001-4","volume":"18","author":"C Schmid","year":"1994","unstructured":"Schmid, C., Biegler, L.T.: Quadratic programming methods for reduced hessian sqp. Comput. Chem. Eng. 18(9), 817\u2013832 (1994)","journal-title":"Comput. Chem. Eng."},{"unstructured":"Spellucci, P.: Solving general convex QP problems via an exact quadratic augmented Lagrangian with bound constraints. Techn. Hochsch, Fachbereich Mathematik (1993)","key":"9886_CR72"},{"issue":"5","key":"9886_CR73","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1155\/S1110757X04309071","volume":"2004","author":"SM Stefanov","year":"2004","unstructured":"Stefanov, S.M.: Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in $$\\mathbb{R}^n$$ R n . J. Appl. Math. 2004(5), 409\u2013431 (2004)","journal-title":"J. Appl. Math."},{"issue":"1\u20134","key":"9886_CR74","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1080\/10556789908805759","volume":"11","author":"RJ Vanderbei","year":"1999","unstructured":"Vanderbei, R.J.: LOQO: an interior point code for quadratic programming. Optim. Methods Softw. 11(1\u20134), 451\u2013484 (1999)","journal-title":"Optim. Methods Softw."},{"key":"9886_CR75","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","volume":"7","author":"JWJ Williams","year":"1964","unstructured":"Williams, J.W.J.: Algorithm 232. Heapsort. Commun. ACM 7, 347\u2013348 (1964)","journal-title":"Commun. ACM"},{"issue":"1","key":"9886_CR76","doi-asserted-by":"crossref","first-page":"8","DOI":"10.4236\/am.2010.11002","volume":"1","author":"G Yuan","year":"2010","unstructured":"Yuan, G., Lu, S., Wei, Z.: A modified limited SQP method for constrained optimization. Appl. Math. 1(1), 8\u201317 (2010)","journal-title":"Appl. Math."},{"issue":"4","key":"9886_CR77","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1137\/0803039","volume":"3","author":"C Zhu","year":"1993","unstructured":"Zhu, C., Rockafellar, R.T.: Primal-dual projected gradient algorithms for extended linear-quadratic programming. SIAM J. Optim. 3(4), 751\u2013783 (1993)","journal-title":"SIAM J. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9886-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-016-9886-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9886-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T22:50:21Z","timestamp":1718923821000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-016-9886-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,1]]},"references-count":77,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["9886"],"URL":"https:\/\/doi.org\/10.1007\/s10589-016-9886-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2016,12,1]]}}}