{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T06:13:51Z","timestamp":1784873631430,"version":"3.55.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,4,11]],"date-time":"2024-04-11T00:00:00Z","timestamp":1712793600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,11]],"date-time":"2024-04-11T00:00:00Z","timestamp":1712793600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s10957-024-02421-6","type":"journal-article","created":{"date-parts":[[2024,4,11]],"date-time":"2024-04-11T08:02:40Z","timestamp":1712822560000},"page":"1198-1228","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Computing Second-Order Points Under Equality Constraints: Revisiting Fletcher\u2019s Augmented Lagrangian"],"prefix":"10.1007","volume":"201","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5531-5673","authenticated-orcid":false,"given":"Florentin","family":"Goyens","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Armin","family":"Eftekhari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicolas","family":"Boumal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,4,11]]},"reference":[{"key":"2421_CR1","unstructured":"Ablin, P., Peyr\u00e9, G.: Fast and accurate optimization on the orthogonal manifold without retraction. In International Conference on Artificial Intelligence and Statistics, pp. 5636\u20135657. PMLR (2022)"},{"key":"2421_CR2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400830244","volume-title":"Optimization Algorithms on Matrix Manifolds","author":"P-A Absil","year":"2008","unstructured":"Absil, P.-A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton (2008). https:\/\/doi.org\/10.1515\/9781400830244"},{"issue":"5\u20136","key":"2421_CR3","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1080\/02331930701618617","volume":"56","author":"R Andreani","year":"2007","unstructured":"Andreani, R., Mart\u00ednez, J.M., Schuverdt, M.L.: On second-order optimality conditions for nonlinear programming. Optimization 56(5\u20136), 529\u2013542 (2007). https:\/\/doi.org\/10.1080\/02331930701618617","journal-title":"Optimization"},{"key":"2421_CR4","unstructured":"Bai, Y., Mei, S.: Analysis of Sequential Quadratic Programming Through the Lens of Riemannian Optimization. arXiv preprint arXiv:1805.08756 (2018)"},{"key":"2421_CR5","unstructured":"Bai, Y., Duchi, J., Mei, S.: Proximal Algorithms for Constrained Composite Optimization, with Applications to Solving Low-Rank SDPs. arXiv preprint arXiv:1903.00184 (2019)"},{"issue":"2","key":"2421_CR6","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/s10957-017-1093-4","volume":"173","author":"GC Bento","year":"2017","unstructured":"Bento, G.C., Ferreira, O.P., Melo, J.G.: iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds. J. Optim. Theory Appl. 173(2), 548\u2013562 (2017). https:\/\/doi.org\/10.1007\/s10957-017-1093-4","journal-title":"J. Optim. Theory Appl."},{"key":"2421_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/C2013-0-10366-2","volume-title":"Constrained Optimization and Lagrange Multiplier Methods","author":"DP Bertsekas","year":"1982","unstructured":"Bertsekas, D.P.: Constrained Optimization and Lagrange Multiplier Methods. Academic Press, Cambridge (1982). https:\/\/doi.org\/10.1016\/C2013-0-10366-2"},{"issue":"5","key":"2421_CR8","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1080\/10556788.2020.1746962","volume":"35","author":"EG Birgin","year":"2020","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: Complexity and performance of an augmented Lagrangian algorithm. Optim. Methods Softw. 35(5), 885\u2013920 (2020). https:\/\/doi.org\/10.1080\/10556788.2020.1746962","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"2421_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/imanum\/drx080","volume":"39","author":"N Boumal","year":"2019","unstructured":"Boumal, N., Absil, P.-A., Cartis, C.: Global rates of convergence for nonconvex optimization on manifolds. IMA J. Numer. Anal. 39(1), 1\u201333 (2019). https:\/\/doi.org\/10.1093\/imanum\/drx080","journal-title":"IMA J. Numer. Anal."},{"key":"2421_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/9781009166164","volume-title":"An Introduction to Optimization on Smooth Manifolds","author":"Nicolas Boumal","year":"2023","unstructured":"Boumal, Nicolas: An Introduction to Optimization on Smooth Manifolds. Cambridge University Press, Cambridge (2023). https:\/\/doi.org\/10.1017\/9781009166164"},{"issue":"2","key":"2421_CR11","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10107-002-0352-8","volume":"95","author":"S Burer","year":"2003","unstructured":"Burer, S., Monteiro, R.D.C.: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Math. Program. 95(2), 329\u2013357 (2003). https:\/\/doi.org\/10.1007\/s10107-002-0352-8","journal-title":"Math. Program."},{"issue":"1","key":"2421_CR12","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.jco.2011.06.001","volume":"28","author":"C Cartis","year":"2012","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: Complexity bounds for second-order optimality in unconstrained optimization. J. Complex. 28(1), 93\u2013108 (2012). https:\/\/doi.org\/10.1016\/j.jco.2011.06.001","journal-title":"J. Complex."},{"key":"2421_CR13","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.jco.2018.11.001","volume":"53","author":"C Cartis","year":"2019","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization. J. Complex. 53, 68\u201394 (2019). https:\/\/doi.org\/10.1016\/j.jco.2018.11.001","journal-title":"J. Complex."},{"key":"2421_CR14","first-page":"23923","volume":"35","author":"D Cifuentes","year":"2022","unstructured":"Cifuentes, D., Moitra, A.: Polynomial time guarantees for the Burer\u2013Monteiro method. Adv. Neural Inf. Process. Syst. 35, 23923\u201323935 (2022)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"2421_CR15","doi-asserted-by":"publisher","unstructured":"Di\u00a0Pillo, G.: Exact penalty methods. In: Algorithms for Continuous Optimization, pp. 209\u2013253. Springer, Dordrecht (1994). https:\/\/doi.org\/10.1007\/978-94-009-0369-2_8","DOI":"10.1007\/978-94-009-0369-2_8"},{"issue":"1","key":"2421_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02591986","volume":"36","author":"G Di Pillo","year":"1986","unstructured":"Di Pillo, G., Grippo, L.: An exact penalty function method with global convergence properties for nonlinear programming problems. Math. Program. 36(1), 1\u201318 (1986). https:\/\/doi.org\/10.1007\/BF02591986","journal-title":"Math. Program."},{"issue":"6","key":"2421_CR17","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1137\/0327068","volume":"27","author":"G Di Pillo","year":"1989","unstructured":"Di Pillo, G., Grippo, L.: Exact penalty functions in constrained optimization. SIAM J. Control. Optim. 27(6), 1333\u20131360 (1989). https:\/\/doi.org\/10.1137\/0327068","journal-title":"SIAM J. Control. Optim."},{"issue":"3","key":"2421_CR18","doi-asserted-by":"publisher","first-page":"A1809","DOI":"10.1137\/19M1238265","volume":"42","author":"R Estrin","year":"2020","unstructured":"Estrin, R., Friedlander, M.P., Orban, D., Saunders, M.A.: Implementing a smooth exact penalty function for equality-constrained nonlinear optimization. SIAM J. Sci. Comput. 42(3), A1809\u2013A1835 (2020). https:\/\/doi.org\/10.1137\/19M1238265","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"2421_CR19","doi-asserted-by":"publisher","first-page":"A1836","DOI":"10.1137\/19M1255069","volume":"42","author":"R Estrin","year":"2020","unstructured":"Estrin, R., Friedlander, M.P., Orban, D., Saunders, M.A.: Implementing a smooth exact penalty function for general constrained nonlinear optimization. SIAM J. Sci. Comput. 42(3), A1836\u2013A1859 (2020). https:\/\/doi.org\/10.1137\/19M1255069","journal-title":"SIAM J. Sci. Comput."},{"key":"2421_CR20","doi-asserted-by":"crossref","unstructured":"Fletcher, R.: A class of methods for nonlinear programming with termination and convergence properties. In: Integer and nonlinear programming, pp. 157\u2013173. Amsterdam (1970)","DOI":"10.1016\/B978-0-12-597050-1.50007-5"},{"issue":"3","key":"2421_CR21","doi-asserted-by":"publisher","first-page":"A1949","DOI":"10.1137\/18M1221679","volume":"41","author":"B Gao","year":"2019","unstructured":"Gao, B., Liu, X., Yuan, Y.-X.: Parallelizable algorithms for optimization problems with orthogonality constraints. SIAM J. Sci. Comput. 41(3), A1949\u2013A1983 (2019). https:\/\/doi.org\/10.1137\/18M1221679","journal-title":"SIAM J. Sci. Comput."},{"key":"2421_CR22","unstructured":"Ge, R., Huang, F., Jin, C., Yuan, Y.: Escaping from saddle points\u2014online stochastic gradient for tensor decomposition. In: Proceedings of The 28th Conference on Learning Theory, pp. 797\u2013842. PMLR (2015)"},{"key":"2421_CR23","unstructured":"Goyens, F., Eftekhari, A., Boumal, N.: Computing second-order points under equality constraints: revisiting Fletcher\u2019s augmented Lagrangian. arXiv preprint arXiv:2204.01448 (2022)"},{"issue":"2","key":"2421_CR24","doi-asserted-by":"publisher","first-page":"1508","DOI":"10.1093\/imanum\/draa021","volume":"41","author":"GN Grapiglia","year":"2021","unstructured":"Grapiglia, G.N., Yuan, Y.-X.: On the complexity of an augmented Lagrangian method for nonconvex optimization. IMA J. Numer. Anal. 41(2), 1508\u20131530 (2021). https:\/\/doi.org\/10.1093\/imanum\/draa021","journal-title":"IMA J. Numer. Anal."},{"issue":"2","key":"2421_CR25","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/j.laa.2006.11.024","volume":"422","author":"I Grubi\u0161i\u0107","year":"2007","unstructured":"Grubi\u0161i\u0107, I., Pietersz, R.: Efficient rank reduction of correlation matrices. Linear Algebra Appl. 422(2), 629\u2013653 (2007). https:\/\/doi.org\/10.1016\/j.laa.2006.11.024","journal-title":"Linear Algebra Appl."},{"key":"2421_CR26","doi-asserted-by":"crossref","unstructured":"He, C., Lu, Z., Pong, T.\u00a0K.: A Newton-CG based augmented Lagrangian method for finding a second-order stationary point of nonconvex equality constrained optimization with complexity guarantees. arXiv preprint arXiv:2301.03139 (2023)","DOI":"10.1137\/22M1489824"},{"key":"2421_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511840371","volume-title":"Topics in Matrix Analysis","author":"RA Horn","year":"1991","unstructured":"Horn, R.A., Johnson, C.R.: Topics in Matrix Analysis. Cambridge University Press, Cambridge (1991). https:\/\/doi.org\/10.1017\/CBO9780511840371"},{"key":"2421_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91755-9","volume-title":"Introduction to Riemannian Manifolds","author":"John M Lee","year":"2018","unstructured":"Lee, John M.: Introduction to Riemannian Manifolds, vol. 2. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91755-9"},{"issue":"1","key":"2421_CR29","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s10107-022-01896-3","volume":"200","author":"S Ling","year":"2023","unstructured":"Ling, S.: Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis. Math. Program. 200(1), 589\u2013628 (2023). https:\/\/doi.org\/10.1007\/s10107-022-01896-3","journal-title":"Math. Program."},{"key":"2421_CR30","unstructured":"\u0141ojasiewicz, S.: Sur les trajectoires du gradient d\u2019une fonction analytique. Seminari di geometria, pp. 115\u2013117, (1982)"},{"key":"2421_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization","author":"Yurii Nesterov","year":"2004","unstructured":"Nesterov, Yurii: Introductory Lectures on Convex Optimization. Springer, New York (2004). https:\/\/doi.org\/10.1007\/978-1-4419-8853-9"},{"issue":"4","key":"2421_CR32","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1016\/0041-5553(63)90382-3","volume":"3","author":"BT Polyak","year":"1963","unstructured":"Polyak, B.T.: Gradient methods for minimizing functionals. Zhurnal Vychislitel\u2019noi Matematiki i Matematicheskoi Fiziki 3(4), 643\u2013653 (1963). https:\/\/doi.org\/10.1016\/0041-5553(63)90382-3","journal-title":"Zhurnal Vychislitel\u2019noi Matematiki i Matematicheskoi Fiziki"},{"issue":"3","key":"2421_CR33","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1080\/10556780802699433","volume":"24","author":"RA Polyak","year":"2009","unstructured":"Polyak, R.A.: On the local quadratic convergence of the primal-dual augmented Lagrangian method. Optim. Methods Softw. 24(3), 369\u2013379 (2009). https:\/\/doi.org\/10.1080\/10556780802699433","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"2421_CR34","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1146\/annurev-control-072720-082553","volume":"4","author":"DM Rosen","year":"2021","unstructured":"Rosen, D.M., Doherty, K.J., Ter\u00e1n Espinoza, A., Leonard, J.J.: Advances in inference and representation for simultaneous localization and mapping. Annu. Rev. Control Robot. Auton. Syst. 4(1), 215\u2013242 (2021). https:\/\/doi.org\/10.1146\/annurev-control-072720-082553","journal-title":"Annu. Rev. Control Robot. Auton. Syst."},{"issue":"1","key":"2421_CR35","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s10107-019-01362-7","volume":"180","author":"CW Royer","year":"2020","unstructured":"Royer, C.W., O\u2019Neill, M., Wright, S.J.: A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization. Math. Program. 180(1), 451\u2013488 (2020). https:\/\/doi.org\/10.1007\/s10107-019-01362-7","journal-title":"Math. Program."},{"key":"2421_CR36","unstructured":"Schechtman, S., Tiapkin, D., Muehlebach, M., Moulines, E.: Orthogonal Directions Constrained Gradient Method: From non-linear equality constraints to Stiefel manifold. arXiv preprint arXiv:2303.09261 (2023)"},{"key":"2421_CR37","doi-asserted-by":"publisher","DOI":"10.1017\/9781009004282","volume-title":"Optimization for Data Analysis","author":"SJ Wright","year":"2022","unstructured":"Wright, S.J., Recht, B.: Optimization for Data Analysis. Cambridge University Press, Cambridge (2022). https:\/\/doi.org\/10.1017\/9781009004282"},{"key":"2421_CR38","unstructured":"Xiao, N., Liu, X.: Solving optimization problems over the Stiefel manifold by smooth exact penalty function. arXiv preprint arXiv:2110.08986 (2021)"},{"issue":"4","key":"2421_CR39","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1080\/10556788.2020.1852236","volume":"37","author":"N Xiao","year":"2022","unstructured":"Xiao, N., Liu, X., Yuan, Y.-X.: A class of smooth exact penalty function methods for optimization problems with orthogonality constraints. Optim. Methods Softw. 37(4), 1205\u20131241 (2022). https:\/\/doi.org\/10.1080\/10556788.2020.1852236","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"2421_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10915-021-01409-y","volume":"86","author":"Y Xie","year":"2021","unstructured":"Xie, Y., Wright, S.J.: Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints. J. Sci. Comput. 86(3), 1\u201330 (2021). https:\/\/doi.org\/10.1007\/s10915-021-01409-y","journal-title":"J. Sci. Comput."},{"key":"2421_CR41","unstructured":"Zhang, H., Sra, S.: First-order methods for geodesically convex optimization. In: Conference on Learning Theory, pp. 1617\u20131638. PMLR (2016)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02421-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-024-02421-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02421-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T07:17:52Z","timestamp":1719213472000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-024-02421-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,11]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["2421"],"URL":"https:\/\/doi.org\/10.1007\/s10957-024-02421-6","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,11]]},"assertion":[{"value":"2 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}