{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:25:34Z","timestamp":1762521934551,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,10,4]],"date-time":"2016-10-04T00:00:00Z","timestamp":1475539200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,10,4]],"date-time":"2016-10-04T00:00:00Z","timestamp":1475539200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CBET-1160014"],"award-info":[{"award-number":["CBET-1160014"]}],"id":[{"id":"10.13039\/100000001","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,4]]},"DOI":"10.1007\/s10589-016-9880-7","type":"journal-article","created":{"date-parts":[[2016,10,4]],"date-time":"2016-10-04T17:33:05Z","timestamp":1475602385000},"page":"401-424","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Structured regularization for barrier NLP solvers"],"prefix":"10.1007","volume":"66","author":[{"given":"Wei","family":"Wan","sequence":"first","affiliation":[]},{"given":"Lorenz T.","family":"Biegler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,4]]},"reference":[{"issue":"12","key":"9880_CR1","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1016\/0098-1354(94)00123-5","volume":"19","author":"I Quesada","year":"1995","unstructured":"Quesada, I., Grossmann, I.: Global optimization of bilinear process networks with multicomponent flows. Comput. Chem. Eng. 19(12), 1219\u20131242 (1995)","journal-title":"Comput. Chem. Eng."},{"key":"9880_CR2","volume-title":"Systematic Methods for Chemical Process Design","author":"LT Biegler","year":"1997","unstructured":"Biegler, L.T., Grossman, I.E., Westerberg, A.W.: Systematic Methods for Chemical Process Design. Prentice Hall PTR, Upper Saddle River (1997)"},{"issue":"12","key":"9880_CR3","doi-asserted-by":"publisher","first-page":"2903","DOI":"10.1016\/j.compchemeng.2008.02.010","volume":"32","author":"B Baumrucker","year":"2008","unstructured":"Baumrucker, B., Renfro, J., Biegler, L.T.: Mpec problem formulations and solution strategies with chemical engineering applications. Comput. Chem. Eng. 32(12), 2903\u20132913 (2008)","journal-title":"Comput. Chem. Eng."},{"issue":"2","key":"9880_CR4","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1137\/050644938","volume":"30","author":"S Kameswaran","year":"2008","unstructured":"Kameswaran, S., Biegler, L.: Advantages of nonlinear-programming-based methodologies for inequality path-constrained optimal control problems: a numerical study. SIAM J. Sci. Comput. 30(2), 957\u2013981 (2008)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"9880_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF02591747","volume":"31","author":"A Drud","year":"1985","unstructured":"Drud, A.: Conopt: a GRG code for large sparse dynamic nonlinear optimization problems. Math. Program. 31(2), 153\u2013191 (1985)","journal-title":"Math. Program."},{"key":"9880_CR6","doi-asserted-by":"crossref","unstructured":"Murtagh B.A., Saunders, M.A.: Minos 5.51 users guide (1983)","DOI":"10.21236\/ADA138522"},{"issue":"1","key":"9880_CR7","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/S0036144504446096","volume":"47","author":"P Gill","year":"2005","unstructured":"Gill, P., Murray, W., Saunders, M.: Snopt: an SQP algorithm for large-scale constrained optimization. SIAM Rev. 47(1), 99\u2013131 (2005)","journal-title":"SIAM Rev."},{"issue":"1","key":"9880_CR8","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1137\/S1052623402407382","volume":"17","author":"R Fletcher","year":"2006","unstructured":"Fletcher, R., Leyffer, S., Ralph, D., Scholtes, S.: Local convergence of SQP methods for mathematical programs with equilibrium constraints. SIAM J. Optim. 17(1), 259\u2013286 (2006)","journal-title":"SIAM J. Optim."},{"issue":"21","key":"9880_CR9","doi-asserted-by":"publisher","first-page":"6803","DOI":"10.1021\/ie0341000","volume":"43","author":"MYB Poku","year":"2004","unstructured":"Poku, M.Y.B., Biegler, L.T., Kelly, J.D.: Nonlinear optimization with many degrees of freedom in process engineering. Ind. Eng. Chem. Res. 43(21), 6803\u20136812 (2004)","journal-title":"Ind. Eng. Chem. Res."},{"issue":"4","key":"9880_CR10","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1137\/S0036144502414942","volume":"44","author":"A Forsgren","year":"2002","unstructured":"Forsgren, A., Gill, P.E., Wright, M.H.: Interior methods for nonlinear optimization. SIAM Rev. 44(4), 525\u2013597 (2002)","journal-title":"SIAM Rev."},{"key":"9880_CR11","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/0-387-30065-1_4","volume-title":"Large-Scale Nonlinear Optimization","author":"RH Byrd","year":"2006","unstructured":"Byrd, R.H., Nocedal, J., Waltz, R.A.: Knitro: an integrated package for nonlinear optimization. Large-Scale Nonlinear Optimization, pp. 35\u201359. Springer, Berlin (2006)"},{"issue":"1\u20134","key":"9880_CR12","doi-asserted-by":"publisher","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."},{"issue":"1","key":"9880_CR13","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006)","journal-title":"Math. Program."},{"key":"9880_CR14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719383","volume-title":"Nonlinear Programming: Concepts, Algorithms, and Applications to Chemical Processes","author":"LT Biegler","year":"2010","unstructured":"Biegler, L.T.: Nonlinear Programming: Concepts, Algorithms, and Applications to Chemical Processes. SIAM, Philadelphia (2010)"},{"key":"9880_CR15","doi-asserted-by":"publisher","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. ACM Trans. Math. Softw. 9, 302\u2013325 (1983)","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"9880_CR16","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1145\/992200.992202","volume":"30","author":"IS Duff","year":"2004","unstructured":"Duff, I.S.: Ma57\u2013a 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."},{"key":"9880_CR17","unstructured":"Hogg, J.D., Scott, J.A.: HSL_MA97: A bit-compatible multifrontal code for sparse symmetric systems. Science and Technology Facilities Council (2011)"},{"issue":"2","key":"9880_CR18","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1016\/S0045-7825(99)00242-X","volume":"184","author":"PR Amestoy","year":"2000","unstructured":"Amestoy, P.R., Duff, I.S., L\u2019Excellent, J.-Y.: Multifrontal parallel distributed symmetric and unsymmetric solvers. Comput. Methods Appl. Mech. Eng. 184(2), 501\u2013520 (2000)","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"9880_CR19","unstructured":"Gupta, A.: WSMP: Watson sparse matrix package (part-ii: direct solution of general sparse systems, Technical report, Citeseer (2000)"},{"key":"9880_CR20","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-3-642-40047-6_54","volume-title":"Euro-Par 2013 Parallel Processing of Lecture Notes in Computer Science","author":"A Kuzmin","year":"2013","unstructured":"Kuzmin, A., Luisier, M., Schenk, O.: Fast methods for computing selected elements of the Green\u2019s function in massively parallel nanoelectronic device simulations. In: Wolf, F., Mohr, B., Mey, D. (eds.) Euro-Par 2013 Parallel Processing of Lecture Notes in Computer Science, vol. 8097, pp. 533\u2013544. Springer, Berlin Heidelberg (2013)"},{"issue":"2","key":"9880_CR21","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1093\/imamat\/23.2.235","volume":"23","author":"IS Duff","year":"1979","unstructured":"Duff, I.S., Reid, J.K., Munksgaard, N., Nielsen, H.B.: Direct solution of sets of linear equations whose matrix is sparse, symmetric and indefinite. IMA J. Appl. Math. 23(2), 235\u2013250 (1979)","journal-title":"IMA J. Appl. Math."},{"key":"9880_CR22","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.compchemeng.2013.04.023","volume":"57","author":"K Wang","year":"2013","unstructured":"Wang, K., Shao, Z., Lang, Y., Qian, J., Biegler, L.T.: Barrier NLP methods with structured regularization for optimization of degenerate optimization problems. Comput. Chem. Eng. 57, 24\u201329 (2013)","journal-title":"Comput. Chem. Eng."},{"issue":"2","key":"9880_CR23","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s101070100244","volume":"91","author":"R Fletcher","year":"2002","unstructured":"Fletcher, R., Leyffer, S.: Nonlinear programming without a penalty function. Math. Program. 91(2), 239\u2013269 (2002)","journal-title":"Math. Program."},{"issue":"1","key":"9880_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S1052623403426556","volume":"16","author":"A W\u00e4chter","year":"2005","unstructured":"W\u00e4chter, A., Biegler, L.T.: Line search filter methods for nonlinear programming: motivation and global convergence. SIAM J. Optim. 16(1), 1\u201331 (2005)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"9880_CR25","doi-asserted-by":"publisher","first-page":"1885","DOI":"10.1137\/140996677","volume":"25","author":"NI Gould","year":"2015","unstructured":"Gould, N.I., Loh, Y., Robinson, D.P.: A nonmonotone filter SQP method: local convergence and numerical results. SIAM J. Optim. 25(3), 1885\u20131911 (2015)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9880_CR26","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1137\/130920599","volume":"24","author":"NI Gould","year":"2014","unstructured":"Gould, N.I., 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":"1, Ser. A","key":"9880_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-005-0701-5","volume":"108","author":"L Chen","year":"2006","unstructured":"Chen, L., Goldfarb, D.: Interior-point $$\\ell _2$$-penalty methods for nonlinear programming with strong global convergence properties. Math. Program. 108(1, Ser. A), 1\u201336 (2006)","journal-title":"Math. Program."},{"issue":"1","key":"9880_CR28","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1137\/S1052623403426544","volume":"16","author":"A W\u00e4chter","year":"2005","unstructured":"W\u00e4chter, A., Biegler, L.T.: Line search filter methods for nonlinear programming: local convergence. SIAM J. Optim. 16(1), 32\u201348 (2005)","journal-title":"SIAM J. Optim."},{"key":"9880_CR29","doi-asserted-by":"crossref","unstructured":"Dowling, A.W., Biegler, L.T.: Degeneracy hunter: An algorithm for determining irreducible sets of degenerate constraints in mathematical programs. In: Gernaey, J.K.H., Krist V., Gani, R. (eds.) 12th International Symposium on Process Systems Engineering and 25th European Symposium on Computer Aided Process Engineering, vol. 37 of Computer Aided Chemical Engineering, pp. 809\u2013814, Elsevier (2015)","DOI":"10.1016\/B978-0-444-63578-5.50130-4"},{"issue":"4","key":"9880_CR30","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"NI Gould","year":"2003","unstructured":"Gould, N.I., Orban, D., Toint, P.L.: Cuter and sifdec: a constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29(4), 373\u2013394 (2003)","journal-title":"ACM Trans. Math. Softw."},{"issue":"3","key":"9880_CR31","doi-asserted-by":"publisher","first-page":"1224","DOI":"10.1137\/08072471X","volume":"20","author":"FE Curtis","year":"2009","unstructured":"Curtis, F.E., Nocedal, J., W\u00e4chter, A.: A matrix-free algorithm for equality constrained optimization problems with rank-deficient jacobians. SIAM J. Optim. 20(3), 1224\u20131249 (2009)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9880_CR32","doi-asserted-by":"publisher","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."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9880-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-016-9880-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9880-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T10:54:52Z","timestamp":1589712892000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-016-9880-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,4]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["9880"],"URL":"https:\/\/doi.org\/10.1007\/s10589-016-9880-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2016,10,4]]},"assertion":[{"value":"2 January 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 October 2016","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}