{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:43Z","timestamp":1740122683897,"version":"3.37.3"},"reference-count":73,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T00:00:00Z","timestamp":1724976000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T00:00:00Z","timestamp":1724976000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-2211491","IIS-2211492"],"award-info":[{"award-number":["IIS-2211491","IIS-2211492"]}],"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":[[2024,12]]},"DOI":"10.1007\/s10589-024-00603-6","type":"journal-article","created":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T11:03:18Z","timestamp":1725015798000},"page":"843-894","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization"],"prefix":"10.1007","volume":"89","author":[{"given":"Chuan","family":"He","sequence":"first","affiliation":[]},{"given":"Heng","family":"Huang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3277-7853","authenticated-orcid":false,"given":"Zhaosong","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,30]]},"reference":[{"key":"603_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, N., Allen-Zhu, Z., Bullins, B., Hazan, E., Ma, T.: Finding approximate local minima faster than gradient descent. In: Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, pp. 1195\u20131199 (2017)","DOI":"10.1145\/3055399.3055464"},{"key":"603_CR2","unstructured":"Allen-Zhu, Z., Li, Y.: Neon2: finding local minima via first-order oracles. Adv. Neural Info. Process. Syst. 31, 3716\u20133726 (2018)"},{"issue":"4","key":"603_CR3","doi-asserted-by":"crossref","first-page":"1286","DOI":"10.1137\/060654797","volume":"18","author":"R Andreani","year":"2008","unstructured":"Andreani, R., Birgin, E.G., Mart\u00ednez, J.M., Schuverdt, M.L.: On augmented Lagrangian methods with general lower-level constraints. SIAM J. Optim. 18(4), 1286\u20131309 (2008)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"603_CR4","doi-asserted-by":"crossref","first-page":"1902","DOI":"10.1093\/imanum\/drx011","volume":"37","author":"R Andreani","year":"2017","unstructured":"Andreani, R., Haeser, G., Ramos, A., Silva, P.J.: A second-order sequential optimality condition associated to the convergence of optimization algorithms. IMA J. Numer. Anal. 37(4), 1902\u20131929 (2017)","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"603_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1015451203254","volume":"114","author":"M Arg\u00e1ez","year":"2002","unstructured":"Arg\u00e1ez, M., Tapia, R.: On the global convergence of a modified augmented Lagrangian linesearch interior-point Newton method for nonlinear programming. J. Optim. Theory Appl 114(1), 1\u201325 (2002)","journal-title":"J. Optim. Theory Appl"},{"issue":"2","key":"603_CR6","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s10957-017-1071-x","volume":"173","author":"P Armand","year":"2017","unstructured":"Armand, P., Omheni, R.: A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization. J. Optim. Theory Appl. 173(2), 523\u2013547 (2017)","journal-title":"J. Optim. Theory Appl."},{"issue":"5","key":"603_CR7","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1080\/10556788.2018.1528250","volume":"34","author":"P Armand","year":"2019","unstructured":"Armand, P., Tran, N.N.: Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization. Optim. Methods Softw. 34(5), 991\u20131013 (2019)","journal-title":"Optim. Methods Softw."},{"key":"603_CR8","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific. (1995)"},{"key":"603_CR9","unstructured":"Bhojanapalli, S., Neyshabur, B., Srebro, N.: Global optimality of local search for low rank matrix recovery. Adv. Neural Info. Process. Syst. 29, 3873\u20133881 (2016)"},{"issue":"1","key":"603_CR10","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s10107-014-0753-5","volume":"149","author":"W Bian","year":"2015","unstructured":"Bian, W., Chen, X., Ye, Y.: Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization. Math. Program. 149(1), 301\u2013327 (2015)","journal-title":"Math. Program."},{"issue":"2","key":"603_CR11","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1137\/15M1031631","volume":"26","author":"EG Birgin","year":"2016","unstructured":"Birgin, E.G., Gardenghi, J., Mart\u00ednez, J.M., Santos, S.A., Toint, P.L.: Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models. SIAM J. Optim. 26(2), 951\u2013967 (2016)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"603_CR12","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s10589-017-9937-2","volume":"69","author":"EG Birgin","year":"2018","unstructured":"Birgin, E.G., Haeser, G., Ramos, A.: Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points. Comput. Optim. and Appl. 69(1), 51\u201375 (2018)","journal-title":"Comput. Optim. and Appl."},{"key":"603_CR13","doi-asserted-by":"crossref","unstructured":"Birgin, E. G., Mart\u00ednez, J.M.: Practical augmented Lagrangian methods for constrained optimization. SIAM (2014)","DOI":"10.1137\/1.9781611973365"},{"issue":"2","key":"603_CR14","doi-asserted-by":"crossref","first-page":"1049","DOI":"10.1137\/16M110280X","volume":"27","author":"EG Birgin","year":"2017","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: The use of quadratic regularization with a cubic descent condition for unconstrained optimization. SIAM J. Optim. 27(2), 1049\u20131074 (2017)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"603_CR15","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1137\/0805038","volume":"5","author":"JF Bonnans","year":"1995","unstructured":"Bonnans, J.F., Launay, G.: Sequential quadratic programming with penalization of the displacement. SIAM J. Optim. 5(4), 792\u2013812 (1995)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"603_CR16","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1137\/18M1216146","volume":"30","author":"LF Bueno","year":"2020","unstructured":"Bueno, L.F., Mart\u00ednez, J.M.: On the complexity of an inexact restoration method for constrained optimization. SIAM J. Optim. 30(1), 80\u2013101 (2020)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"603_CR17","doi-asserted-by":"crossref","first-page":"1152","DOI":"10.1137\/0724076","volume":"24","author":"RH Byrd","year":"1987","unstructured":"Byrd, R.H., Schnabel, R.B., Shultz, G.A.: A trust region algorithm for nonlinearly constrained optimization. SIAM J. Numer. Anal. 24(5), 1152\u20131170 (1987)","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"603_CR18","doi-asserted-by":"crossref","first-page":"2146","DOI":"10.1137\/17M1113898","volume":"29","author":"Y Carmon","year":"2019","unstructured":"Carmon, Y., Duchi, J.: Gradient descent finds the cubic-regularized nonconvex newton step. SIAM J. Optim. 29(3), 2146\u20132178 (2019)","journal-title":"SIAM J. Optim."},{"key":"603_CR19","unstructured":"Carmon,Y., Duchi, J.C., Hinder, O., Sidford, A.:\u201cConvex until proven guilty\": dimension-free acceleration of gradient descent on non-convex functions. In: International conference on machine learning, pp. 654\u2013663. PMLR, (2017)"},{"issue":"2","key":"603_CR20","doi-asserted-by":"crossref","first-page":"1751","DOI":"10.1137\/17M1114296","volume":"28","author":"Y Carmon","year":"2018","unstructured":"Carmon, Y., Duchi, J.C., Hinder, O., Sidford, A.: Accelerated methods for nonconvex optimization. SIAM J. Optim. 28(2), 1751\u20131772 (2018)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"603_CR21","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10107-009-0286-5","volume":"127","author":"C Cartis","year":"2011","unstructured":"Cartis, C., Gould, N.I., Toint, P.L.: Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results. Math. Program. 127(2), 245\u2013295 (2011)","journal-title":"Math. Program."},{"issue":"3","key":"603_CR22","doi-asserted-by":"crossref","first-page":"1553","DOI":"10.1137\/120869687","volume":"23","author":"C Cartis","year":"2013","unstructured":"Cartis, C., Gould, N.I., Toint, P.L.: On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization. SIAM J. Optim. 23(3), 1553\u20131574 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"603_CR23","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s10107-012-0617-9","volume":"144","author":"C Cartis","year":"2014","unstructured":"Cartis, C., Gould, N.I., Toint, P.L.: On the complexity of finding first-order critical points in constrained nonlinear optimization. Math. Program. 144(1), 93\u2013106 (2014)","journal-title":"Math. Program."},{"issue":"1","key":"603_CR24","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s10107-012-0617-9","volume":"144","author":"C Cartis","year":"2014","unstructured":"Cartis, C., Gould, N.I., Toint, P.L.: On the complexity of finding first-order critical points in constrained nonlinear optimization. Math. Program. 144(1), 93\u2013106 (2014)","journal-title":"Math. Program."},{"issue":"2","key":"603_CR25","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1137\/130915546","volume":"53","author":"C Cartis","year":"2015","unstructured":"Cartis, C., Gould, N.I., Toint, P.L.: On the evaluation complexity of constrained nonlinear least-squares and general constrained nonlinear optimization using second-order methods. SIAM J. Numer. Anal. 53(2), 836\u2013851 (2015)","journal-title":"SIAM J. Numer. Anal."},{"key":"603_CR26","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/978-3-030-12767-1_2","volume-title":"Approximation and Optimization: Algorithms, Complexity and Applications","author":"C Cartis","year":"2019","unstructured":"Cartis, C., Gould, N.I., Toint, P.L.: Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled KKT conditions, high-order models and the criticality measure $$\\chi $$. In: Demetriou, I., Pardalos, P. (eds.) Approximation and Optimization: Algorithms, Complexity and Applications, pp. 5\u201326. Springer, NY (2019)"},{"key":"603_CR27","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.jco.2018.11.001","volume":"53","author":"C Cartis","year":"2019","unstructured":"Cartis, C., Gould, N.I., Toint, P.L.: Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization. J. Complex. 53, 68\u201394 (2019)","journal-title":"J. Complex."},{"issue":"1","key":"603_CR28","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1137\/15M1052834","volume":"55","author":"X Chen","year":"2017","unstructured":"Chen, X., Guo, L., Lu, Z., Ye, J.J.: An augmented Lagrangian method for non-Lipschitz nonconvex programming. SIAM J. Numer. Anal. 55(1), 168\u2013193 (2017)","journal-title":"SIAM J. Numer. Anal."},{"issue":"20","key":"603_CR29","doi-asserted-by":"crossref","first-page":"5239","DOI":"10.1109\/TSP.2019.2937282","volume":"67","author":"Y Chi","year":"2019","unstructured":"Chi, Y., Lu, Y.M., Chen, Y.: Nonconvex optimization meets low-rank matrix factorization: an overview. IEEE Trans. Signal Process. 67(20), 5239\u20135269 (2019)","journal-title":"IEEE Trans. Signal Process."},{"key":"603_CR30","unstructured":"Cifuentes, D., Moitra, A.: Polynomial time guarantees for the Burer-Monteiro method. (2019) arXiv:1912.01745"},{"issue":"2","key":"603_CR31","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1023\/A:1013764800871","volume":"21","author":"TF Coleman","year":"2002","unstructured":"Coleman, T.F., Liu, J., Yuan, W.: A new trust-region algorithm for equality constrained optimization. Comput. Optim. Appl. 21(2), 177\u2013199 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"603_CR32","volume-title":"LANCELOT: a Fortran package for large-scale nonlinear optimization","author":"AR Conn","year":"2013","unstructured":"Conn, A.R., Gould, G., Toint, P.L.: LANCELOT: a Fortran package for large-scale nonlinear optimization. Springer Science & Business Media, NY (2013)"},{"issue":"217","key":"603_CR33","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1090\/S0025-5718-97-00777-1","volume":"66","author":"AR Conn","year":"1997","unstructured":"Conn, A.R., Gould, N.I., Toint, P.L.: A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds. Math. Comput. 66(217), 261\u2013288 (1997)","journal-title":"Math. Comput."},{"issue":"1","key":"603_CR34","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1137\/19M130563X","volume":"31","author":"FE Curtis","year":"2021","unstructured":"Curtis, F.E., Robinson, D.P., Royer, C.W., Wright, S.J.: Trust-region Newton-CG with strong second-order complexity guarantees for nonconvex optimization. SIAM J. Optim. 31(1), 518\u2013544 (2021)","journal-title":"SIAM J. Optim."},{"issue":"162","key":"603_CR35","first-page":"1","volume":"1","author":"FE Curtis","year":"2016","unstructured":"Curtis, F.E., Robinson, D.P., Samadi, M.: A trust region algorithm with a worst-case iteration complexity of $$\\cal{O} (\\epsilon ^{-3\/2})$$ for nonconvex optimization. Math. Program. 1(162), 1\u201332 (2016)","journal-title":"Math. Program."},{"issue":"2","key":"603_CR36","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1137\/16M1108650","volume":"28","author":"FE Curtis","year":"2018","unstructured":"Curtis, F.E., Robinson, D.P., Samadi, M.: Complexity analysis of a trust funnel algorithm for equality constrained optimization. SIAM J. Optim. 28(2), 1533\u20131563 (2018)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"603_CR37","first-page":"529","volume":"200","author":"EP De Carvalho","year":"2008","unstructured":"De Carvalho, E.P., dos Santos J\u00fanior, A., Ma, T.F.: Reduced gradient method combined with augmented Lagrangian and barrier for the optimal power flow problem. Appl. Math. Comput. 200(2), 529\u2013536 (2008)","journal-title":"Appl. Math. Comput."},{"key":"603_CR38","unstructured":"P. Dvurechensky and M. Staudigl. Hessian barrier algorithms for non-convex conic optimization. (2021) arXiv:2111.00100"},{"issue":"1","key":"603_CR39","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1023\/A:1008705028512","volume":"14","author":"D Goldfarb","year":"1999","unstructured":"Goldfarb, D., Polyak, R., Scheinberg, K., Yuzefovich, I.: A modified barrier-augmented Lagrangian method for constrained minimization. Comput. Optim. Appl. 14(1), 55\u201374 (1999)","journal-title":"Comput. Optim. Appl."},{"key":"603_CR40","unstructured":"F. Goyens, A. Eftekhari, and N. Boumal. Computing second-order points under equality constraints: revisiting Fletcher\u2019s augmented Lagrangian. (2022) arXiv:2204.01448"},{"issue":"2","key":"603_CR41","doi-asserted-by":"crossref","first-page":"1546","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), 1546\u20131568 (2021)","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"603_CR42","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s10107-018-1290-4","volume":"178","author":"G Haeser","year":"2019","unstructured":"Haeser, G., Liu, H., Ye, Y.: Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary. Math. Program. 178(1), 263\u2013299 (2019)","journal-title":"Math. Program."},{"issue":"2","key":"603_CR43","doi-asserted-by":"crossref","first-page":"1191","DOI":"10.1137\/21M1457011","volume":"33","author":"C He","year":"2023","unstructured":"He, C., Lu, Z.: A Newton-CG based barrier method for finding a second-order stationary point of nonconvex conic optimization with complexity guarantees. SIAM J. Optim. 33(2), 1191\u20131222 (2023)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"603_CR44","doi-asserted-by":"crossref","first-page":"1734","DOI":"10.1137\/22M1489824","volume":"33","author":"C He","year":"2023","unstructured":"He, C., Lu, Z., Pong, T.K.: A Newton-CG based augmented Lagrangian method for finding a second-order stationary point of nonconvex equality constrained optimization with complexity guarantees. SIAM J. Optim. 33(3), 1734\u20131766 (2023)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"603_CR45","doi-asserted-by":"crossref","first-page":"2590","DOI":"10.1109\/TGRS.2009.2038483","volume":"48","author":"A Huck","year":"2010","unstructured":"Huck, A., Guillaume, M., Blanc-Talon, J.: Minimum dispersion constrained nonnegative matrix factorization to unmix hyperspectral data. IEEE Trans. Geosci. Remote Sens. 48(6), 2590\u20132602 (2010)","journal-title":"IEEE Trans. Geosci. Remote Sens."},{"key":"603_CR46","unstructured":"C. Jin, P. Netrapalli, and M. I. Jordan. Accelerated gradient descent escapes saddle points faster than gradient descent. In: Conference on learning theory, pp. 1042\u20131085. (2018)"},{"issue":"6","key":"603_CR47","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1016\/j.orl.2017.09.005","volume":"45","author":"C Kanzow","year":"2017","unstructured":"Kanzow, C., Steck, D.: An example comparing the standard and safeguarded augmented Lagrangian methods. Oper. Res. Lett. 45(6), 598\u2013603 (2017)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"603_CR48","doi-asserted-by":"crossref","first-page":"1094","DOI":"10.1137\/0613066","volume":"13","author":"J Kuczy\u0144ski","year":"1992","unstructured":"Kuczy\u0144ski, J., Wo\u017aniakowski, H.: Estimating the largest eigenvalue by the power and Lanczos algorithms with a random start. SIAM J. Matrix Anal. Appl. 13(4), 1094\u20131122 (1992)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"603_CR49","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s00186-017-0625-x","volume":"87","author":"R Kuhlmann","year":"2018","unstructured":"Kuhlmann, R., B\u00fcskens, C.: A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm. Math. Method Oper. Res. 87(3), 451\u2013483 (2018)","journal-title":"Math. Method Oper. Res."},{"issue":"2","key":"603_CR50","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1109\/TGRS.2010.2068053","volume":"49","author":"X Liu","year":"2010","unstructured":"Liu, X., Xia, W., Wang, B., Zhang, L.: An approach based on constrained nonnegative matrix factorization to unmix hyperspectral data. IEEE Trans. Geosci. Remote Sens. 49(2), 757\u2013772 (2010)","journal-title":"IEEE Trans. Geosci. Remote Sens."},{"key":"603_CR51","first-page":"2811","volume":"33","author":"S Lu","year":"2020","unstructured":"Lu, S., Razaviyayn, M., Yang, B., Huang, K., Hong, M.: Finding second-order stationary points efficiently in smooth nonconvex linearly constrained optimization problems. Adv. Neural Info. Process. Syst. 33, 2811\u20132822 (2020)","journal-title":"Adv. Neural Info. Process. Syst."},{"issue":"1","key":"603_CR52","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s10107-011-0452-4","volume":"135","author":"Z Lu","year":"2012","unstructured":"Lu, Z., Zhang, Y.: An augmented Lagrangian approach for sparse principal component analysis. Math. Program. 135(1), 149\u2013193 (2012)","journal-title":"Math. Program."},{"issue":"2","key":"603_CR53","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10898-016-0475-8","volume":"68","author":"JM Mart\u00ednez","year":"2017","unstructured":"Mart\u00ednez, J.M., Raydan, M.: Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization. J. Glob. Optim. 68(2), 367\u2013385 (2017)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"603_CR54","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1109\/TGRS.2006.888466","volume":"45","author":"L Miao","year":"2007","unstructured":"Miao, L., Qi, H.: Endmember extraction from highly mixed data using minimum volume constrained nonnegative matrix factorization. IEEE Trans. Geosci. Remote Sens. 45(3), 765\u2013777 (2007)","journal-title":"IEEE Trans. Geosci. Remote Sens."},{"issue":"3","key":"603_CR55","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/s10107-002-0360-8","volume":"95","author":"JM Moguerza","year":"2003","unstructured":"Moguerza, J.M., Prieto, F.J.: An augmented Lagrangian interior-point method using directions of negative curvature. Math. Program. 95(3), 573\u2013616 (2003)","journal-title":"Math. Program."},{"key":"603_CR56","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-point polynomial algorithms in convex programming","author":"Y Nesterov","year":"1994","unstructured":"Nesterov, Y., Nemirovskii, A.: Interior-point polynomial algorithms in convex programming. SIAM, Philadelphia (1994)"},{"issue":"1","key":"603_CR57","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10107-006-0706-8","volume":"108","author":"Y Nesterov","year":"2006","unstructured":"Nesterov, Y., Polyak, B.T.: Cubic regularization of Newton method and its global performance. Math. Program. 108(1), 177\u2013205 (2006)","journal-title":"Math. Program."},{"issue":"1","key":"603_CR58","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1093\/imanum\/drz074","volume":"41","author":"M O\u2019Neill","year":"2021","unstructured":"O\u2019Neill, M., Wright, S.J.: A log-barrier Newton-CG method for bound constrained optimization with complexity guarantees. IMA J. Numer. Anal. 41(1), 84\u2013121 (2021)","journal-title":"IMA J. Numer. Anal."},{"key":"603_CR59","unstructured":"Park, D., Kyrillidis, A., Carmanis, C., Sanghavi, S.: Non-square matrix sensing without spurious local minima via the burer-monteiro approach. In Artificial intelligence and statistics, pp. 65\u201374. PMLR, (2017)"},{"issue":"1","key":"603_CR60","doi-asserted-by":"crossref","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)","journal-title":"Math. Program."},{"issue":"2","key":"603_CR61","doi-asserted-by":"crossref","first-page":"1448","DOI":"10.1137\/17M1134329","volume":"28","author":"CW Royer","year":"2018","unstructured":"Royer, C.W., Wright, S.J.: Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization. SIAM J. Optim. 28(2), 1448\u20131477 (2018)","journal-title":"SIAM J. Optim."},{"key":"603_CR62","doi-asserted-by":"crossref","DOI":"10.2307\/j.ctvcm4hcj","volume-title":"Nonlinear optimization","author":"A Ruszczynski","year":"2011","unstructured":"Ruszczynski, A.: Nonlinear optimization. Princeton University Press, NJ (2011)"},{"key":"603_CR63","unstructured":"M. F. Sahin, A. Eftekhari, A. Alacaoglu, F. Latorre, and V. Cevher. An inexact augmented Lagrangian framework for nonconvex optimization with nonlinear constraints. Adv. Neural Info. Process. Syst. 32, 632\u2013650 (2019)"},{"key":"603_CR64","doi-asserted-by":"crossref","unstructured":"Thanh, O. V., Gillis, N., Lecron, F.: Bounded simplex-structured matrix factorization. In ICASSP 2022-2022 IEEE International conference on acoustics, speech and signal processing (ICASSP), pp. 9062\u20139066. IEEE, (2022)","DOI":"10.1109\/ICASSP43922.2022.9747124"},{"issue":"1","key":"603_CR65","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1023\/A:1008677427361","volume":"13","author":"RJ Vanderbei","year":"1999","unstructured":"Vanderbei, R.J., Shanno, D.F.: An interior-point algorithm for nonconvex nonlinear programming. Comput. Optim. Appl. 13(1), 231\u2013252 (1999)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"603_CR66","doi-asserted-by":"crossref","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."},{"issue":"3","key":"603_CR67","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s10107-004-0560-5","volume":"107","author":"RA Waltz","year":"2006","unstructured":"Waltz, R.A., Morales, J.L., Nocedal, J., Orban, D.: An interior algorithm for nonlinear optimization that combines line search and trust region steps. Math. Program. 107(3), 391\u2013408 (2006)","journal-title":"Math. Program."},{"issue":"7","key":"603_CR68","doi-asserted-by":"crossref","first-page":"2479","DOI":"10.1109\/TSP.2009.2016892","volume":"57","author":"SJ Wright","year":"2009","unstructured":"Wright, S.J., Nowak, R.D., Figueiredo, M.A.: Sparse reconstruction by separable approximation. IEEE Trans. Signal Process. 57(7), 2479\u20132493 (2009)","journal-title":"IEEE Trans. Signal Process."},{"key":"603_CR69","unstructured":"Xie, P., Wright, S.J.: Complexity of projected Newton methods for bound-constrained optimization. (2021) arXiv:2103.15989"},{"issue":"3","key":"603_CR70","first-page":"1","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)","journal-title":"J. Sci. Comput."},{"key":"603_CR71","unstructured":"Xu, Y., Jin, R., Yang, Y.: NEON+: Accelerated gradient methods for extracting negative curvature for non-convex optimization. (2017) arXiv:1712.01033"},{"issue":"3","key":"603_CR72","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s12532-015-0082-6","volume":"7","author":"L Yang","year":"2015","unstructured":"Yang, L., Sun, D., Toh, K.C.: SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints. Math. Program. Comput. 7(3), 331\u2013366 (2015)","journal-title":"Math. Program. Comput."},{"issue":"4","key":"603_CR73","doi-asserted-by":"crossref","first-page":"1737","DOI":"10.1137\/080718206","volume":"20","author":"X Zhao","year":"2010","unstructured":"Zhao, X., Sun, D., Toh, K.C.: A Newton-CG augmented Lagrangian method for semidefinite programming. SIAM J. Optim. 20(4), 1737\u20131765 (2010)","journal-title":"SIAM J. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00603-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-024-00603-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00603-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,15]],"date-time":"2024-11-15T13:12:49Z","timestamp":1731676369000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-024-00603-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,30]]},"references-count":73,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["603"],"URL":"https:\/\/doi.org\/10.1007\/s10589-024-00603-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2024,8,30]]},"assertion":[{"value":"2 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The third author is an editorial board member of this journal.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}