{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T13:21:18Z","timestamp":1762089678339,"version":"build-2065373602"},"reference-count":73,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T00:00:00Z","timestamp":1689120000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T00:00:00Z","timestamp":1689120000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["19H04069","20K19748","20H04145","23H03351"],"award-info":[{"award-number":["19H04069","20K19748","20H04145","23H03351"]}],"id":[{"id":"10.13039\/501100001691","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":[[2023,11]]},"DOI":"10.1007\/s10589-023-00501-3","type":"journal-article","created":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T11:02:08Z","timestamp":1689159728000},"page":"555-598","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems"],"prefix":"10.1007","volume":"86","author":[{"given":"Shun","family":"Arahata","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2178-1494","authenticated-orcid":false,"given":"Takayuki","family":"Okuno","sequence":"additional","affiliation":[]},{"given":"Akiko","family":"Takeda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,12]]},"reference":[{"issue":"2","key":"501_CR1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s10589-009-9240-y","volume":"45","author":"R Andreani","year":"2010","unstructured":"Andreani, R., Birgin, E.G., Mart\u00ednez, J.M., Schuverdt, M.L.: Second-order negative-curvature methods for box-constrained and general constrained optimization. Comput. Optim. Appl. 45(2), 209\u2013236 (2010)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"501_CR2","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s10107-018-1354-5","volume":"180","author":"R Andreani","year":"2020","unstructured":"Andreani, R., Haeser, G., Viana, D.S.: Optimality conditions and global convergence for nonlinear semidefinite programming. Math. Program. 180(1), 203\u2013235 (2020)","journal-title":"Math. Program."},{"issue":"5\u20136","key":"501_CR3","doi-asserted-by":"crossref","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)","journal-title":"Optimization"},{"unstructured":"Arahata, S., Okuno, T., Takeda, A.: Interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems using negative curvature. arXiv preprint arXiv:2103.14320 (2021)","key":"501_CR4"},{"issue":"1","key":"501_CR5","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01588245","volume":"17","author":"A Auslender","year":"1979","unstructured":"Auslender, A.: Penalty methods for computing points that satisfy second order necessary conditions. Math. Program. 17(1), 229\u2013238 (1979)","journal-title":"Math. Program."},{"key":"501_CR6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First-Order Methods in Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-Order Methods in Optimization. SIAM, Philadelphia (2017)"},{"issue":"4","key":"501_CR7","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1115\/1.2901581","volume":"61","author":"MP Bendsoe","year":"1994","unstructured":"Bendsoe, M.P., Guedes, J.M., Haber, R.B., Pedersen, P., Taylor, J.E.: An analytical model to predict optimal material properties in the context of optimal structural design. J. Appl. Mech. 61(4), 930\u2013937 (1994)","journal-title":"J. Appl. Mech."},{"key":"501_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1394-9","volume-title":"Perturbation Analysis of Optimization Problems","author":"J Bonnans","year":"2000","unstructured":"Bonnans, J., Shapiro, A.: Perturbation Analysis of Optimization Problems. Springer, New York (2000)"},{"key":"501_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"unstructured":"Bradbury, J., Frostig, R., Hawkins, P., Johnson, M.J., Leary, C., Maclaurin, D., Necula, G., Paszke, A., VanderPlas, J., Wanderman-Milne, S., Zhang, Q.: JAX: composable transformations of Python+NumPy programs. http:\/\/github.com\/google\/jax","key":"501_CR10"},{"issue":"2","key":"501_CR11","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s101070050112","volume":"87","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Orban, D., Toint, P.L.: A primal-dual trust-region algorithm for non-convex nonlinear programming. Math. Program. 87(2), 215\u2013249 (2000)","journal-title":"Math. Program."},{"issue":"1","key":"501_CR12","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/S1052623402417298","volume":"15","author":"R Correa","year":"2004","unstructured":"Correa, R., Ramirez, C.H.: A global algorithm for nonlinear semidefinite programming. SIAM J. Optim. 15(1), 303\u2013318 (2004)","journal-title":"SIAM J. Optim."},{"issue":"8","key":"501_CR13","doi-asserted-by":"crossref","first-page":"1713","DOI":"10.1007\/s11590-018-1286-2","volume":"12","author":"FE Curtis","year":"2018","unstructured":"Curtis, F.E., Lubberts, Z., Robinson, D.P.: Concise complexity analyses for trust region methods. Optim. Lett. 12(8), 1713\u20131724 (2018)","journal-title":"Optim. Lett."},{"issue":"1","key":"501_CR14","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s10107-018-1335-8","volume":"176","author":"FE Curtis","year":"2019","unstructured":"Curtis, F.E., Robinson, D.P.: Exploiting negative curvature in deterministic and stochastic optimization. Math. Program. 176(1), 69\u201394 (2019)","journal-title":"Math. Program."},{"issue":"1","key":"501_CR15","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":"1","key":"501_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-016-1026-2","volume":"162","author":"FE Curtis","year":"2017","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. 162(1), 1\u201332 (2017)","journal-title":"Math. Program."},{"issue":"4","key":"501_CR17","doi-asserted-by":"crossref","first-page":"897","DOI":"10.1287\/moor.1050.0150","volume":"30","author":"G Di Pillo","year":"2005","unstructured":"Di Pillo, G., Lucidi, S., Palagi, L.: Convergence to second-order stationary points of a primal-dual algorithm model for nonlinear programming. Math. of Oper. Res. 30(4), 897\u2013915 (2005)","journal-title":"Math. of Oper. Res."},{"issue":"1","key":"501_CR18","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF02192282","volume":"91","author":"MM El-Alem","year":"1996","unstructured":"El-Alem, M.M.: Convergence to a second-order point of a trust-region algorithm with a nonmonotonic penalty parameter for constrained optimization. J. Optim. Theory Appl. 91(1), 61\u201379 (1996)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"501_CR19","doi-asserted-by":"crossref","first-page":"746","DOI":"10.1287\/moor.23.3.746","volume":"23","author":"F Facchinei","year":"1998","unstructured":"Facchinei, F., Lucidi, S.: Convergence to Second order stationary points in inequality constrained optimization. Math. Oper. Res. 23(3), 746\u2013766 (1998)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"501_CR20","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1080\/00207170010010605","volume":"74","author":"B Fares","year":"2001","unstructured":"Fares, B., Apkarian, P., Noll, D.: An augmented Lagrangian method for a class of LMI-constrained problems in robust control theory. Int. J. Control 74(4), 348\u2013360 (2001)","journal-title":"Int. J. Control"},{"doi-asserted-by":"crossref","unstructured":"Fazel, M., Hindi, H., Boyd, S.P.: Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices. In: Proceedings of the 2003 American Control Conference, vol. 3, pp. 2156\u20132162 (2003)","key":"501_CR21","DOI":"10.1109\/ACC.2003.1243393"},{"issue":"1","key":"501_CR22","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/PL00011370","volume":"88","author":"A Forsgren","year":"2000","unstructured":"Forsgren, A.: Optimality conditions for nonconvex semidefinite programming. Math. Program. 88(1), 105\u2013128 (2000)","journal-title":"Math. Program."},{"issue":"1","key":"501_CR23","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1137\/S1052623494279122","volume":"7","author":"A Forsgren","year":"1997","unstructured":"Forsgren, A., Murray, W.: Newton methods for large-scale linear inequality-constrained minimization. SIAM J. Optim. 7(1), 162\u2013176 (1997)","journal-title":"SIAM J. Optim."},{"issue":"2\u20133","key":"501_CR24","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/s10107-006-0028-x","volume":"109","author":"RW Freund","year":"2007","unstructured":"Freund, R.W., Jarre, F., Vogelbusch, C.H.: Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling. Math. Program. 109(2\u20133), 581\u2013611 (2007)","journal-title":"Math. Program."},{"issue":"2","key":"501_CR25","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/s10589-018-0017-z","volume":"71","author":"EH Fukuda","year":"2018","unstructured":"Fukuda, E.H., Louren\u00e7o, B.F.: Exact augmented Lagrangian functions for nonlinear semidefinite programming. Comput. Optim. Appl. 71(2), 457\u2013482 (2018)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"501_CR26","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s10589-017-9925-6","volume":"68","author":"D Goldfarb","year":"2017","unstructured":"Goldfarb, D., Mu, C., Wright, J., Zhou, C.: Using negative curvature in solving nonlinear programs. Comput. Optim. Appl. 68(3), 479\u2013502 (2017)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"501_CR27","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1007\/s10957-020-01713-x","volume":"186","author":"N Hallak","year":"2020","unstructured":"Hallak, N., Teboulle, M.: Finding second-order stationary points in constrained minimization: a feasible direction approach. J. Optim. Theory Appl. 186(2), 480\u2013503 (2020)","journal-title":"J. Optim. Theory Appl."},{"unstructured":"Hinder, O., Ye, Y.: Worst-case iteration bounds for log barrier methods for problems with nonconvex constraints. arXiv:1807.00404 (2020)","key":"501_CR28"},{"issue":"1","key":"501_CR29","doi-asserted-by":"crossref","first-page":"13","DOI":"10.3166\/ejc.9.13-28","volume":"9","author":"C Hoi","year":"2003","unstructured":"Hoi, C., Scherer, C., van der Mech\u00e9, E., Bosgra, O.: A nonlinear SDP approach to fixed-order controller synthesis and comparison with two other methods applied to an active suspension system. Eur. J. Control. 9(1), 13\u201328 (2003)","journal-title":"Eur. J. Control."},{"key":"501_CR30","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139020411","volume-title":"Matrix Analysis","author":"RA Horn","year":"2012","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis, 2nd edn. Cambridge University Press, Cambridge (2012)","edition":"2"},{"key":"501_CR31","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1023\/A:1011562523132","volume":"1","author":"F Jarre","year":"2000","unstructured":"Jarre, F.: An interior method for nonconvex semidefinite programs. Optim. Eng. 1, 347\u2013372 (2000)","journal-title":"Optim. Eng."},{"issue":"2","key":"501_CR32","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s10957-006-9102-z","volume":"130","author":"Y Kanno","year":"2006","unstructured":"Kanno, Y., Takewaki, I.: Sequential semidefinite program for maximum robustness design of structures under load uncertainty. J. Optim. Theory Appl. 130(2), 265 (2006)","journal-title":"J. Optim. Theory Appl."},{"key":"501_CR33","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/j.cam.2014.07.024","volume":"275","author":"A Kato","year":"2015","unstructured":"Kato, A., Yabe, H., Yamashita, H.: An interior point method with a primal-dual quadratic barrier penalty function for nonlinear semidefinite programming. J. Comput. Appl. Math. 275, 148\u2013161 (2015)","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"501_CR34","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/A:1021985014197","volume":"25","author":"H Konno","year":"2003","unstructured":"Konno, H., Kawadai, N., Tuy, H.: Cutting plane algorithms for nonlinear semi-definite programming problems with applications. J. Global Optim. 25(2), 141\u2013155 (2003)","journal-title":"J. Global Optim."},{"issue":"1","key":"501_CR35","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10287-003-0001-6","volume":"1","author":"H Konno","year":"2003","unstructured":"Konno, H., Kawadai, N., Wu, D.: Estimation of failure probability using semi-definite logit model. Comput. Manage. Sci. 1(1), 59\u201373 (2003)","journal-title":"Comput. Manage. Sci."},{"issue":"1","key":"501_CR36","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.3182\/20050703-6-CZ-1902.00832","volume":"38","author":"M Ko\u010dvara","year":"2005","unstructured":"Ko\u010dvara, M., Leibfritz, F., Stingl, M., Henrion, D.: A nonlinear SDP algorithm for static output feedback problems in COMPleib. IFAC Proceedings Volumes 38(1), 1055\u20131060 (2005)","journal-title":"IFAC Proceedings Volumes"},{"issue":"5","key":"501_CR37","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1080\/10556780410001682844","volume":"19","author":"M Ko\u010dvara","year":"2004","unstructured":"Ko\u010dvara, M., Stingl, M.: Solving nonconvex SDP problems of structural optimization with stability control. Optim. Method. Softw. 19(5), 595\u2013609 (2004)","journal-title":"Optim. Method. Softw."},{"doi-asserted-by":"crossref","unstructured":"Lahat, D., F\u00e9votte, C.: Positive semidefinite matrix factorization: a link to phase retrieval and a block gradient algorithm. In: IEEE International Conference on Acoustics, Speech and Signal Process (2020)","key":"501_CR38","DOI":"10.1109\/ICASSP40776.2020.9053938"},{"issue":"6755","key":"501_CR39","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"DD Lee","year":"1999","unstructured":"Lee, D.D., Seung, H.S.: Learning the parts of objects by non-negative matrix factorization. Nature 401(6755), 788\u2013791 (1999)","journal-title":"Nature"},{"issue":"3","key":"501_CR40","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s10589-007-9163-4","volume":"44","author":"F Leibfritz","year":"2008","unstructured":"Leibfritz, F., Maruhn, J.H.: A successive SDP-NSDP approach to a robust optimization problem in finance. Comput. Optim. Appl. 44(3), 443 (2008)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"501_CR41","doi-asserted-by":"crossref","first-page":"1048","DOI":"10.1137\/S1052623400375865","volume":"12","author":"F Leibfritz","year":"2002","unstructured":"Leibfritz, F., Mostafa, E.M.E.: An interior point constrained trust region method for a special class of nonlinear semidefinite programming problems. SIAM J. Optim. 12(4), 1048\u20131074 (2002)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"501_CR42","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10107-016-1040-4","volume":"168","author":"BF Louren\u00e7o","year":"2018","unstructured":"Louren\u00e7o, B.F., Fukuda, E.H., Fukushima, M.: Optimality conditions for nonlinear semidefinite programming via squared slack variables. Math. Program. 168(1), 177\u2013200 (2018)","journal-title":"Math. Program."},{"unstructured":"Lu, S., Razaviyayn, M., Yang, B., Huang, K., Hong, M.: Finding second-order stationary points efficiently in smooth nonconvex linearly constrained optimization problems. In: Advances in Neural Information Processing Systems, 33, 2811\u20132822 (2020)","key":"501_CR43"},{"issue":"1","key":"501_CR44","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01584328","volume":"13","author":"GP McCormick","year":"1977","unstructured":"McCormick, G.P.: A modification of Armijo\u2019s step-size rule for negative curvature. Math. Program. 13(1), 111\u2013115 (1977)","journal-title":"Math. Program."},{"issue":"3","key":"501_CR45","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":"501_CR46","first-page":"3629","volume":"31","author":"A Mokhtari","year":"2018","unstructured":"Mokhtari, A., Ozdaglar, A., Jadbabaie, A.: Escaping saddle points in constrained optimization. Adv. Neural Inf. Process. Syst. 31, 3629\u20133639 (2018)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"4","key":"501_CR47","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF00933150","volume":"26","author":"H Mukai","year":"1978","unstructured":"Mukai, H., Polak, E.: A second-order method for the general nonlinear programming problem. J. Optim. Theory Appl. 26(4), 515\u2013532 (1978)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"501_CR48","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"KG Murty","year":"1987","unstructured":"Murty, K.G., Kabadi, S.N.: Some NP-complete problems in quadratic and nonlinear programming. Math. Program. 39(2), 117\u2013129 (1987)","journal-title":"Math. Program."},{"issue":"1","key":"501_CR49","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."},{"unstructured":"Nouiehed, M., Lee, J.D., Razaviyayn, M.: Convergence to second-order stationarity for constrained non-convex optimization. arXiv:1810.02024 (2020)","key":"501_CR50"},{"issue":"3","key":"501_CR51","doi-asserted-by":"crossref","first-page":"2501","DOI":"10.1137\/19M1256415","volume":"30","author":"M Nouiehed","year":"2020","unstructured":"Nouiehed, M., Razaviyayn, M.: A trust region method for finding second-order stationarity in linearly constrained nonconvex optimization. SIAM J. Optim. 30(3), 2501\u20132529 (2020)","journal-title":"SIAM J. Optim."},{"unstructured":"Okuno, T.: Local convergence of primal-dual interior point methods for nonlinear semi-definite optimization using the family of Monteiro\u2013Tsuchiya directions. arXiv:2009.03020 (2020)","key":"501_CR52"},{"key":"501_CR53","doi-asserted-by":"crossref","DOI":"10.1016\/j.cam.2020.112784","volume":"376","author":"T Okuno","year":"2020","unstructured":"Okuno, T., Fukushima, M.: An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs. J. Comput. Appl. Math. 376, 112784 (2020)","journal-title":"J. Comput. Appl. Math."},{"doi-asserted-by":"crossref","unstructured":"Okuno, T., Fukushima, M.: Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints. Math. Program. pp. 1\u201353 (2022)","key":"501_CR54","DOI":"10.1007\/s10107-022-01827-2"},{"doi-asserted-by":"crossref","unstructured":"O\u2019Neill, M., Wright, S.J.: A log-barrier Newton-CG method for bound constrained optimization with complexity guarantees. IMA J. Numer. Anal. (2020)","key":"501_CR55","DOI":"10.1093\/imanum\/drz074"},{"issue":"2","key":"501_CR56","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1002\/env.3170050203","volume":"5","author":"P Paatero","year":"1994","unstructured":"Paatero, P., Tapper, U.: Positive matrix factorization: a non-negative factor model with optimal utilization of error estimates of data values. Environmetrics 5(2), 111\u2013126 (1994)","journal-title":"Environmetrics"},{"issue":"1","key":"501_CR57","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1287\/moor.1080.0315","volume":"34","author":"H Qi","year":"2009","unstructured":"Qi, H.: Local duality of nonlinear semidefinite programming. Math. Oper. Res. 34(1), 124\u2013141 (2009)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"501_CR58","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1137\/050624509","volume":"28","author":"H Qi","year":"2006","unstructured":"Qi, H., Sun, D.: A quadratically convergent newton method for computing the nearest correlation matrix. SIAM J. Matrix Anal. Appl. 28(2), 360\u2013385 (2006)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"501_CR59","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":"1","key":"501_CR60","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF02614439","volume":"77","author":"A Shapiro","year":"1997","unstructured":"Shapiro, A.: First and second order analysis of nonlinear semidefinite programs. Math. Program. 77(1), 301\u2013320 (1997)","journal-title":"Math. Program."},{"issue":"2","key":"501_CR61","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1137\/0719026","volume":"19","author":"DC Sorensen","year":"1982","unstructured":"Sorensen, D.C.: Newton\u2019s method with a model trust region modification. SIAM J. Numer. Anal. 19(2), 409\u2013426 (1982)","journal-title":"SIAM J. Numer. Anal."},{"issue":"4","key":"501_CR62","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1287\/moor.1060.0195","volume":"31","author":"D Sun","year":"2006","unstructured":"Sun, D.: The strong second-order sufficient condition and constraint nondegeneracy in nonlinear semidefinite programming and their implications. Math. Oper. Res. 31(4), 761\u2013776 (2006)","journal-title":"Math. Oper. Res."},{"unstructured":"Sun, Y., Fazel, M.: Escaping saddle points efficiently in equality-constrained optimization problems. In: Workshop on Modern Trends in Nonconvex Optimization for Machine Learning at International Conference on Machine Learning (2018)","key":"501_CR63"},{"issue":"1","key":"501_CR64","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s10589-018-9998-x","volume":"71","author":"A Vandaele","year":"2018","unstructured":"Vandaele, A., Glineur, F., Gillis, N.: Algorithms for positive semidefinite factorization. Comput. Optim. Appl. 71(1), 193\u2013219 (2018)","journal-title":"Comput. Optim. Appl."},{"key":"501_CR65","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4381-7","volume-title":"Handbook of Semidefinite Programming: Theory, Algorithms, and Applications","author":"H Wolkowicz","year":"2000","unstructured":"Wolkowicz, H., Saigal, R., Vandenberghe, L.: Handbook of Semidefinite Programming: Theory, Algorithms, and Applications. Kluwer Academic Publishers, Alphen aan den Rijn (2000)"},{"issue":"3","key":"501_CR66","doi-asserted-by":"crossref","first-page":"38","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), 38 (2021)","journal-title":"J. Sci. Comput."},{"key":"501_CR67","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1007\/s10589-022-00402-x","volume":"83","author":"Y Yamakawa","year":"2022","unstructured":"Yamakawa, Y., Okuno, T.: A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs. Comput. Optim. Appl. 83, 1027\u20131064 (2022). https:\/\/doi.org\/10.1007\/s10589-022-00402-x","journal-title":"Comput. Optim. Appl."},{"issue":"3\u20134","key":"501_CR68","first-page":"105","volume":"57","author":"Y Yamakawa","year":"2014","unstructured":"Yamakawa, Y., Yamashita, N.: A two-step primal-dual interior point method for nonlinear semidefinite programming problems and its superlinear convergence. J. Oper. Res. Soc. Jpn. 57(3\u20134), 105\u2013127 (2014)","journal-title":"J. Oper. Res. Soc. Jpn."},{"doi-asserted-by":"crossref","unstructured":"Yamashita, H.: Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming. Optim. Methods Softw. pp. 1\u201335 (2022)","key":"501_CR69","DOI":"10.1080\/10556788.2022.2060973"},{"issue":"1\u20132","key":"501_CR70","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-010-0354-x","volume":"132","author":"H Yamashita","year":"2012","unstructured":"Yamashita, H., Yabe, H.: Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming. Math. Program. 132(1\u20132), 1\u201330 (2012)","journal-title":"Math. Program."},{"issue":"1","key":"501_CR71","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10107-011-0449-z","volume":"135","author":"H Yamashita","year":"2012","unstructured":"Yamashita, H., Yabe, H., Harada, K.: A primal-dual interior point method for nonlinear semidefinite programming. Math. Program. 135(1), 89\u2013121 (2012)","journal-title":"Math. Program."},{"doi-asserted-by":"crossref","unstructured":"Yamashita, H., Yabe, H., Harada, K.: A primal-dual interior point trust-region method for nonlinear semidefinite programming. Optim. Method. Softw. (2020). Published online","key":"501_CR72","DOI":"10.1080\/10556788.2020.1801678"},{"key":"501_CR73","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cam.2016.05.007","volume":"308","author":"Q Zhao","year":"2016","unstructured":"Zhao, Q., Chen, Z.: On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming. J. Comput. Appl. Math. 308, 1\u201319 (2016)","journal-title":"J. Comput. Appl. Math."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00501-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00501-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00501-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T00:43:22Z","timestamp":1729730602000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00501-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,12]]},"references-count":73,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["501"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00501-3","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2023,7,12]]},"assertion":[{"value":"31 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}