{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,17]],"date-time":"2026-09-17T10:59:49Z","timestamp":1789642789594,"version":"4.0.0"},"reference-count":46,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>We propose a method for equality-constrained optimization based on a problem in which all constraints are systematically regularized. The regularization is equivalent to applying an augmented Lagrangian method but the linear system used to compute a search direction is reminiscent of regularized sequential quadratic programming. A limited-memory BFGS approximation to second derivatives allows us to employ iterative methods for linear least squares to compute steps, resulting in a factorization-free implementation. We establish global and fast local convergence under weak assumptions. In particular, we do not require the LICQ and our method is suitable for degenerate problems. Preliminary numerical experiments show that a factorization-based implementation of our method exhibits significant robustness while a factorization-free implementation, though not as robust, is promising. We briefly discuss generalizing our framework to other classes of methods and to problems with inequality constraints.<\/jats:p>","DOI":"10.1137\/16m1088570","type":"journal-article","created":{"date-parts":[[2018,5,10]],"date-time":"2018-05-10T12:26:31Z","timestamp":1525955191000},"page":"1613-1639","source":"Crossref","is-referenced-by-count":14,"title":["A Regularized Factorization-Free Method for Equality-Constrained Optimization"],"prefix":"10.1137","volume":"28","author":[{"given":"Sylvain","family":"Arreckx","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dominique","family":"Orban","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,5,10]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2014.891030"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-014-9679-3"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2012.668905"},{"key":"atypb4","first-page":"10","volume":"32","author":"Armand P.","year":"2015","journal-title":"Optim. Methods Softw."},{"key":"atypb5","unstructured":"S. Arreckx, D. Orban, and N. van Omme,\n                      NLP.py-A Large-Scale Optimization Toolkit in Python\n                      , Cahier du GERAD G-2016-42, GERAD, Montre\u0301al, QC, Canada, 2016."},{"key":"atypb6","doi-asserted-by":"crossref","unstructured":"D. P. Bertsekas,\n                      Constrained Optimization and Lagrange Multiplier Methods\n                      , Academic Press, New York, 1996,https:\/\/doi.org\/10.1016\/b978-0-12-093480-5.50005-2.","DOI":"10.1016\/B978-0-12-093480-5.50005-2"},{"key":"atypb7","doi-asserted-by":"crossref","unstructured":"E. G. Birgin and J. M. Marti\u0301nez,\n                      Practical Augmented Lagrangian Methods for Constrained Optimization\n                      , Fundam. Algorithms, SIAM, Philadelphia, 2014,https:\/\/doi.org\/10.1137\/1.9781611973365.","DOI":"10.1137\/1.9781611973365"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492900002518"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-008-0248-3"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582063"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1137\/0802012"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1137\/1019005"},{"key":"atypb13","doi-asserted-by":"crossref","unstructured":"J. E. J. Dennis and R. B. Schnabel,\n                      Numerical Methods for Unconstrained Optimization and Nonlinear Equations\n                      , Classics in Appl. Math. 16, SIAM, Philadelphia, 1996,https:\/\/doi.org\/10.1137\/1.9781611971200.","DOI":"10.1137\/1.9781611971200"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1145\/992200.992202"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-012-9502-y"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-008-0255-4"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1137\/10079687X"},{"key":"atypb18","unstructured":"R. Fourer, D. M. Gay, and B. W. Kernighan,\n                      AMPL: A Modeling Language for Mathematical Programming\n                      , 2nd ed., Brooks\/Cole, Pacific Grove, CA, 2003."},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-012-0035-2"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1007\/BF01593777"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1137\/120882913"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/drw004"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1066-7"},{"key":"atypb24","first-page":"147","author":"Gill P. E.","year":"2011","journal-title":"Springer New York"},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585660"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-014-9687-3"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008640419184"},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1137\/130921738"},{"key":"atypb29","doi-asserted-by":"crossref","unstructured":"W. Hock and K. Schittkowski,\n                      Test Examples for Nonlinear Programming Codes\n                      , Lectures Notes in Econom. and Math. Systems 187, Springer, New York, 1981.","DOI":"10.1007\/978-3-642-48320-2"},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0413-3"},{"key":"atypb31","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-015-9744-6"},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-016-0889-y"},{"key":"atypb33","doi-asserted-by":"publisher","DOI":"10.1007\/BF01589116"},{"key":"atypb34","doi-asserted-by":"crossref","unstructured":"J. Nocedal and S. J. Wright,\n                      Numerical Optimization\n                      , 2nd ed., Springer, New York, 2006,https:\/\/doi.org\/10.1007\/b98874.","DOI":"10.1007\/b98874"},{"key":"atypb35","unstructured":"D. Orban,\n                      PyKrylov: Krylov Subspace Methods in Pure Python\n                      ,https:\/\/github.com\/PythonOptimizers\/pykrylov(2009)."},{"key":"atypb36","doi-asserted-by":"crossref","unstructured":"D. Orban and M. Arioli,\n                      Iterative Solution of Symmetric Quasi-Definite Linear Systems\n                      , SIAM Spotlights 3, SIAM, Philadelphia, 2017,https:\/\/doi.org\/10.1137\/1.9781611974737.","DOI":"10.1137\/1.9781611974737"},{"key":"atypb37","doi-asserted-by":"publisher","DOI":"10.1137\/0712047"},{"key":"atypb38","doi-asserted-by":"publisher","DOI":"10.1145\/355984.355989"},{"key":"atypb39","first-page":"144","author":"M. J.","year":"1978","journal-title":"New York"},{"key":"atypb40","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1.2.97"},{"key":"atypb41","doi-asserted-by":"publisher","DOI":"10.1137\/0805005"},{"key":"atypb42","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0559-y"},{"key":"atypb43","unstructured":"R. B. Wilson,\n                      A Simplicial Method for Convex Programming\n                      , Ph.D. thesis, Harvard University, Cambridge, MA, 1963."},{"key":"atypb44","doi-asserted-by":"crossref","unstructured":"S. J. Wright,\n                      Primal-Dual Interior-Point Methods\n                      , SIAM, Philadelphia, 1997,https:\/\/doi.org\/10.1137\/1.9781611971453.","DOI":"10.1137\/1.9781611971453"},{"key":"atypb45","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018665102534"},{"key":"atypb46","doi-asserted-by":"publisher","DOI":"10.1137\/030601235"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/16M1088570","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:03:41Z","timestamp":1787339021000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/16M1088570"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/16M1088570"],"URL":"https:\/\/doi.org\/10.1137\/16m1088570","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}