{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:38:39Z","timestamp":1758274719625,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T00:00:00Z","timestamp":1552089600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T00:00:00Z","timestamp":1552089600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000015","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":[[2019,4]]},"DOI":"10.1007\/s10589-019-00058-0","type":"journal-article","created":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T11:35:38Z","timestamp":1552131338000},"page":"727-768","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme"],"prefix":"10.1007","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2215-6968","authenticated-orcid":false,"given":"M. Paul","family":"Laiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1542-7889","authenticated-orcid":false,"given":"Andr\u00e9 L.","family":"Tits","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,9]]},"reference":[{"issue":"1\u20134","key":"58_CR1","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1080\/10556789908805754","volume":"11","author":"A Altman","year":"1999","unstructured":"Altman, A., Gondzio, J.: Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization. Optim. Methods Softw. 11(1\u20134), 275\u2013302 (1999)","journal-title":"Optim. Methods Softw."},{"key":"58_CR2","volume-title":"Introduction to Linear Optimization","author":"D Bertsimas","year":"1997","unstructured":"Bertsimas, D., Tsitsiklis, J.: Introduction to Linear Optimization. Athena, Austin (1997)"},{"issue":"3","key":"58_CR3","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1007\/s10589-015-9791-z","volume":"63","author":"C Cartis","year":"2016","unstructured":"Cartis, C., Yan, Y.: Active-set prediction for interior point methods using controlled perturbations. Comput. Optim. Appl. 63(3), 639\u2013684 (2016)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"58_CR4","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s10107-010-0341-2","volume":"130","author":"J Castro","year":"2011","unstructured":"Castro, J., Cuesta, J.: Quadratic regularizations in an interior-point method for primal block-angular problems. Math. Program. 130(2), 415\u2013445 (2011)","journal-title":"Math. Program."},{"issue":"2","key":"58_CR5","doi-asserted-by":"publisher","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":"58_CR6","doi-asserted-by":"crossref","unstructured":"Dantzig, G.B., Ye, Y.: A build-up interior-point method for linear programming: affine scaling form. Technical report, University of Iowa, Iowa City (1991)","DOI":"10.21236\/ADA221802"},{"issue":"2","key":"58_CR7","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1023\/A:1021768121263","volume":"102","author":"L Drummond","year":"1999","unstructured":"Drummond, L., Svaiter, B.: On well definedness of the central path. J. Optim. Theory Appl. 102(2), 223\u2013237 (1999)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"58_CR8","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1137\/S1052623496305882","volume":"9","author":"F Facchinei","year":"1998","unstructured":"Facchinei, F., Fischer, A., Kanzow, C.: On the accurate identification of active constraints. SIAM J Optim. 9(1), 14\u201332 (1998)","journal-title":"SIAM J Optim."},{"key":"58_CR9","series-title":"Pitman Research Notes in Mathematics 303","first-page":"89","volume-title":"Numerical Analysis 1993","author":"PE Gill","year":"1994","unstructured":"Gill, P.E., Murray, W., Poncele\u00f3n, D.B., Saunders, M.A.: Solving reduced KKT systems in barrier methods for linear programming. In: Watson, G.A., Griffiths, D. (eds.) Numerical Analysis 1993. Pitman Research Notes in Mathematics 303, pp. 89\u2013104. Longmans Press, New York (1994)"},{"key":"58_CR10","doi-asserted-by":"crossref","unstructured":"Grant, M., Boyd, S.: Graph implementations for nonsmooth convex programs. In: Blondel, V., Boyd, S., Kimura, H. (eds.) Recent Advances in Learning and Control, Lecture Notes in Control and Information Sciences, pp. 95\u2013110. Springer, Berlin (2008)","DOI":"10.1007\/978-1-84800-155-8_7"},{"key":"58_CR11","unstructured":"Grant, M., Boyd, S.: CVX: Matlab software for disciplined convex programming, version 2.1 (2014). \n                    http:\/\/cvxr.com\/cvx\n                    \n                  . Accessed 27 Feb 2019"},{"issue":"1","key":"58_CR12","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s101070050051","volume":"85","author":"WW Hager","year":"1999","unstructured":"Hager, W.W., Seetharama Gowda, M.: Stability in the presence of degeneracy and error estimation. Math. Program. 85(1), 181\u2013192 (1999)","journal-title":"Math. Program."},{"key":"58_CR13","unstructured":"He, M.: Infeasible constraint reduction for linear and convex quadratic optimization. Ph.D. thesis, University of Maryland (2011). \n                    http:\/\/hdl.handle.net\/1903\/12772\n                    \n                  . Accessed 27 Feb 2019"},{"issue":"4\u20135","key":"58_CR14","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1080\/10556788.2011.589056","volume":"27","author":"MY He","year":"2012","unstructured":"He, M.Y., Tits, A.L.: Infeasible constraint-reduced interior-point methods for linear optimization. Optim. Methods Softw. 27(4\u20135), 801\u2013825 (2012)","journal-title":"Optim. Methods Softw."},{"key":"58_CR15","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-1-4613-3629-7_8","volume-title":"Advances in Optimization and Approximation","author":"D Hertog","year":"1994","unstructured":"Hertog, D., Roos, C., Terlaky, T.: Adding and deleting constraints in the logarithmic barrier method for LP. In: Du, D.Z., Sun, J. (eds.) Advances in Optimization and Approximation, pp. 166\u2013185. Kluwer Academic Publishers, Dordrecht (1994)"},{"key":"58_CR16","unstructured":"Jung, J.H.: Adaptive constraint reduction for convex quadratic programming and training support vector machines. Ph.D. thesis, University of Maryland (2008). \n                    http:\/\/hdl.handle.net\/1903\/8020\n                    \n                  . Accessed 27 Feb 2019"},{"key":"58_CR17","first-page":"156","volume":"31","author":"JH Jung","year":"2008","unstructured":"Jung, J.H., O\u2019Leary, D.P., Tits, A.L.: Adaptive constraint reduction for training support vector machines. Electron. Trans. Numer. Anal. 31, 156\u2013177 (2008)","journal-title":"Electron. Trans. Numer. Anal."},{"issue":"1","key":"58_CR18","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10589-010-9324-8","volume":"51","author":"JH Jung","year":"2012","unstructured":"Jung, J.H., O\u2019Leary, D.P., Tits, A.L.: Adaptive constraint reduction for convex quadratic programming. Comput. Optim. Appl. 51(1), 125\u2013157 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"58_CR19","unstructured":"Laiu, M.P.: Positive filtered P$$_{N}$$ method for linear transport equations and the associated optimization algorithm. Ph.D. thesis, University of Maryland (2016). \n                    http:\/\/hdl.handle.net\/1903\/18732\n                    \n                  . Accessed 27 Feb 2019"},{"issue":"6","key":"58_CR20","doi-asserted-by":"publisher","first-page":"3214","DOI":"10.1137\/15M1052871","volume":"54","author":"MP Laiu","year":"2016","unstructured":"Laiu, M.P., Hauck, C.D., McClarren, R.G., O\u2019Leary, D.P., Tits, A.L.: Positive filtered P$$_{N}$$ moment closures for linear kinetic equations. SIAM J. Numer. Anal. 54(6), 3214\u20133238 (2016)","journal-title":"SIAM J. Numer. Anal."},{"issue":"4","key":"58_CR21","doi-asserted-by":"publisher","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(4), 575\u2013601 (1992)","journal-title":"SIAM J. Optim."},{"key":"58_CR22","series-title":"Springer Series in Operations Research and Financial Engineering","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer Series in Operations Research and Financial Engineering. Springer, New York (2006)"},{"issue":"2","key":"58_CR23","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/s10957-016-0917-y","volume":"170","author":"S Park","year":"2016","unstructured":"Park, S.: A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence. J. Optim. Theory Appl. 170(2), 512\u2013527 (2016)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"58_CR24","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1007\/s10957-015-0714-z","volume":"166","author":"S Park","year":"2015","unstructured":"Park, S., O\u2019Leary, D.P.: A polynomial time constraint-reduced algorithm for semidefinite optimization problems. J. Optim. Theory Appl. 166(2), 558\u2013571 (2015)","journal-title":"J. Optim. Theory Appl."},{"key":"58_CR25","unstructured":"Saunders, M.A., Tomlin, J.A.: Solving regularized linear programs using barrier methods and KKT systems. Technical report, SOL 96-4. Department of Operations Research, Stanford University (1996)"},{"key":"58_CR26","doi-asserted-by":"crossref","unstructured":"Sturm, J.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11\u201312, 625\u2013653 (1999)","DOI":"10.1080\/10556789908805766"},{"issue":"1","key":"58_CR27","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1137\/S1052623401392123","volume":"14","author":"A Tits","year":"2003","unstructured":"Tits, A., W\u00e4chter, A., Bakhtiari, S., Urban, T., Lawrence, C.: A primal\u2013dual interior-point method for nonlinear programming with strong global and local convergence properties. SIAM J. Optim. 14(1), 173\u2013199 (2003)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"58_CR28","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1137\/050633421","volume":"17","author":"AL Tits","year":"2006","unstructured":"Tits, A.L., Absil, P.A., Woessner, W.P.: Constraint reduction for linear programs with many inequality constraints. SIAM J. Optim. 17(1), 119\u2013146 (2006)","journal-title":"SIAM J. Optim."},{"key":"58_CR29","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-1-4613-3632-7_20","volume-title":"Large Scale Optimization: State of the Art","author":"AL Tits","year":"1994","unstructured":"Tits, A.L., Zhou, J.L.: A simple, quadratically convergent algorithm for linear and convex quadratic programming. In: Hager, W., Hearn, D., Pardalos, P. (eds.) Large Scale Optimization: State of the Art, pp. 411\u2013427. Kluwer Academic Publishers, Dordrecht (1994)"},{"issue":"1\u20134","key":"58_CR30","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"KC Toh","year":"1999","unstructured":"Toh, K.C., Todd, M.J., T\u00fct\u00fcnc\u00fc, R.H.: SDPT3: A Matlab software package for semidefinite programming, version 1.3. Optim. Methods Softw. 11(1\u20134), 545\u2013581 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"58_CR31","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF01581252","volume":"59","author":"K Tone","year":"1993","unstructured":"Tone, K.: An active-set strategy in an interior point method for linear programming. Math. Program. 59(1), 345\u2013360 (1993)","journal-title":"Math. Program."},{"issue":"2","key":"58_CR32","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"RH T\u00fct\u00fcnc\u00fc","year":"2003","unstructured":"T\u00fct\u00fcnc\u00fc, R.H., Toh, K.C., Todd, M.J.: Solving semidefinite-quadratic-linear programs using SDPT3. Math. Program. 95(2), 189\u2013217 (2003)","journal-title":"Math. Program."},{"key":"58_CR33","unstructured":"Winternitz, L.: Primal\u2013dual interior-point algorithms for linear programming problems with many inequality constraints. Ph.D. thesis, University of Maryland (2010). \n                    http:\/\/hdl.handle.net\/1903\/10400\n                    \n                  . Accessed 27 Feb 2019"},{"issue":"1","key":"58_CR34","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1007\/s10589-010-9389-4","volume":"51","author":"LB Winternitz","year":"2012","unstructured":"Winternitz, L.B., Nicholls, S.O., Tits, A.L., O\u2019Leary, D.P.: A constraint-reduced variant of Mehrotra\u2019s predictor\u2013corrector algorithm. Comput. Optim. Appl. 51(1), 1001\u20131036 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"58_CR35","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10957-013-0323-7","volume":"160","author":"LB Winternitz","year":"2014","unstructured":"Winternitz, L.B., Tits, A.L., Absil, P.A.: Addressing rank degeneracy in constraint-reduced interior-point methods for linear optimization. J. Optim. Theory App. 160(1), 127\u2013157 (2014)","journal-title":"J. Optim. Theory App."},{"key":"58_CR36","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971453","volume-title":"Primal\u2013Dual Interior-Point Methods","author":"SJ Wright","year":"1997","unstructured":"Wright, S.J.: Primal\u2013Dual Interior-Point Methods. SIAM, Philadelphia (1997)"},{"issue":"2","key":"58_CR37","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1137\/S1052623498333731","volume":"13","author":"SJ Wright","year":"2002","unstructured":"Wright, S.J.: Modifying SQP for degenerate problems. SIAM J. Optim. 13(2), 470\u2013497 (2002)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"58_CR38","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF01585727","volume":"46","author":"Y Ye","year":"1990","unstructured":"Ye, Y.: A \u201cbuild-down\u201d scheme for linear programming. Math. Program. 46(1), 61\u201372 (1990)","journal-title":"Math. Program."},{"issue":"1","key":"58_CR39","doi-asserted-by":"publisher","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(1), 303\u2013318 (1995)","journal-title":"Math. Program."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00058-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00058-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00058-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T11:02:37Z","timestamp":1589713357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00058-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,9]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["58"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00058-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2019,3,9]]},"assertion":[{"value":"28 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}