{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T09:46:26Z","timestamp":1769247986781,"version":"3.49.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Natural Science Foundation of Chi","award":["12071399"],"award-info":[{"award-number":["12071399"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s10589-022-00361-3","type":"journal-article","created":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T17:19:15Z","timestamp":1647278355000},"page":"89-106","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Local saddle points for unconstrained polynomial optimization"],"prefix":"10.1007","volume":"82","author":[{"given":"Wenjie","family":"Zhao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7427-1781","authenticated-orcid":false,"given":"Guangming","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,14]]},"reference":[{"key":"361_CR1","unstructured":"Adolphs, L., Daneshmand, H., Lucchi, A., Hofmann, T.: Local saddle point optimization: A curvature exploitation approach. Presented at the (2019)"},{"issue":"1","key":"361_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/imanum\/drl017","volume":"27","author":"Z Bai","year":"2007","unstructured":"Bai, Z., Golub, G.: Accelerated Hermitian and skew-Hermitian splitting iteration methods for saddle-point problems. IMA J. Numer. Anal. 27(1), 1\u201323 (2007)","journal-title":"IMA J. Numer. Anal."},{"key":"361_CR3","unstructured":"Tal, A., Ghaoui, L., Nemirovski, A.: Robust optimization, vol. 28. Princeton University Press (2009)"},{"issue":"5","key":"361_CR4","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1023\/B:BITN.0000014548.26616.65","volume":"43","author":"M Benzi","year":"2003","unstructured":"Benzi, M., Gander, M., Golub, G.: Optimization of the Hermitian and skew-Hermitian splitting iteration for saddle-point problems. BIT Numer. Math. 43(5), 881\u2013900 (2003)","journal-title":"BIT Numer. Math."},{"key":"361_CR5","unstructured":"Bertsekas, D., Nedic, A., Ozdaglar, A.: Convex Analysis and Optimization. Athena Scientific (2003)"},{"key":"361_CR6","doi-asserted-by":"crossref","unstructured":"Bochnak, J., Coste, M., Roy, M.: Real algebraic geometry, vol. 36. Springer (1998)","DOI":"10.1007\/978-3-662-03718-8"},{"issue":"4","key":"361_CR7","doi-asserted-by":"publisher","first-page":"1125","DOI":"10.1137\/040618680","volume":"27","author":"M Botchev","year":"2006","unstructured":"Botchev, M., Golub, G.: A class of nonsymmetric preconditioners for saddle point problems. SIAM J. Matrix Anal. Appl. 27(4), 1125\u20131149 (2006)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"361_CR8","doi-asserted-by":"publisher","first-page":"1779","DOI":"10.1137\/130919362","volume":"24","author":"Y Chen","year":"2014","unstructured":"Chen, Y., Lan, G., Ouyang, Y.: Optimal primal-dual methods for a class of saddle point problems. SIAM J. Optim. 24(4), 1779\u20131814 (2014)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"361_CR9","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/s10957-016-0949-3","volume":"172","author":"B Cox","year":"2017","unstructured":"Cox, B., Juditsky, A., Nemirovski, A.: Decomposition techniques for bilinear saddle point problems and variational inequalities with affine monotone operators. J. Optim. Theory Appl. 172(2), 402\u2013435 (2017)","journal-title":"J. Optim. Theory Appl."},{"key":"361_CR10","unstructured":"Curto, R., Fialkow, L.: Truncated k-moment problems in several variables. J. Oper. Theory, pp 189\u2013226 (2005)"},{"key":"361_CR11","unstructured":"Dauphin, Y., Pascanu, R., Gulcehre, C., et al.: Identifying and attacking the saddle point problem in high-dimensional non-convex optimization. In: Advances in Neural Information Processing Systems, pp. 2933\u20132941 (2014)"},{"issue":"5","key":"361_CR12","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1137\/04060768X","volume":"27","author":"H Dollar","year":"2006","unstructured":"Dollar, H., Wathen, A.: Approximate factorization constraint preconditioners for saddle-point matrices. SIAM J. Sci. Comput. 27(5), 1555\u20131572 (2006)","journal-title":"SIAM J. Sci. Comput."},{"issue":"6","key":"361_CR13","doi-asserted-by":"publisher","first-page":"1645","DOI":"10.1137\/0731085","volume":"31","author":"H Elman","year":"1994","unstructured":"Elman, H., Golub, G.: Inexact and preconditioned Uzawa algorithms for saddle point problems. SIAM J. Numer. Anal. 31(6), 1645\u20131661 (1994)","journal-title":"SIAM J. Numer. Anal."},{"issue":"6","key":"361_CR14","doi-asserted-by":"publisher","first-page":"1682","DOI":"10.1016\/j.jfa.2012.06.004","volume":"263","author":"L Fialkow","year":"2012","unstructured":"Fialkow, L., Nie, J.: The truncated moment problem via homogenization and flat extensions. J. Funct. Anal. 263(6), 1682\u20131700 (2012)","journal-title":"J. Funct. Anal."},{"key":"361_CR15","unstructured":"Goodfellow, I., Pouget-Abadie, J., Mirza, M., et al.: Generative adversarial nets. In: Advances in Neural Information Processing Systems, pp. 2672\u20132680 (2014)"},{"key":"361_CR16","first-page":"114","volume":"22","author":"C Greif","year":"2006","unstructured":"Greif, C., Sch\u00f6tzau, D.: Preconditioners for saddle point linear systems with highly singular $$(1,1)$$ blocks. ETNA, Special Volume on Saddle Point Problems 22, 114\u2013121 (2006)","journal-title":"ETNA, Special Volume on Saddle Point Problems"},{"issue":"1","key":"361_CR17","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1137\/100814494","volume":"5","author":"B He","year":"2012","unstructured":"He, B., Yuan, X.: Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective. SIAM J. Imag. Sci. 5(1), 119\u2013149 (2012)","journal-title":"SIAM J. Imag. Sci."},{"key":"361_CR18","doi-asserted-by":"crossref","unstructured":"Henrion, D., Lasserre, J.: Detecting global optimality and extracting solutions in gloptipoly. In: Positive Polynomials in Control, pp. 293\u2013310. Springer (2005)","DOI":"10.1007\/10997703_15"},{"issue":"4\u20135","key":"361_CR19","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1080\/10556780802699201","volume":"24","author":"D Henrion","year":"2009","unstructured":"Henrion, D., Lasserre, J., L\u00f6fberg, J.: Gloptipoly 3: moments, optimization and semidefinite programming. Optim. Methods Softw. 24(4\u20135), 761\u2013779 (2009)","journal-title":"Optim. Methods Softw."},{"key":"361_CR20","unstructured":"Kallio, M., Ruszczynski, A.: Perturbation methods for saddle point computation. (1994)"},{"issue":"3","key":"361_CR21","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1512\/iumj.2010.59.4107","volume":"59","author":"I Klep","year":"2010","unstructured":"Klep, I., Schweighofer, M.: Pure states, positive matrix polynomials and sums of Hermitian squares. Indiana Univ. Math. J. 59(3), 857\u2013874 (2010)","journal-title":"Indiana Univ. Math. J."},{"issue":"3","key":"361_CR22","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"J Lasserre","year":"2001","unstructured":"Lasserre, J.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"key":"361_CR23","doi-asserted-by":"crossref","unstructured":"Lasserre, J.: Moments, positive polynomials and their applications, vol. 1. World Scientific (2010)","DOI":"10.1142\/p665"},{"issue":"5","key":"361_CR24","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/s10208-007-9004-y","volume":"8","author":"J Lasserre","year":"2008","unstructured":"Lasserre, J., Laurent, M., Rostalski, P.: Semidefinite characterization and computation of zero-dimensional real radical ideals. Found. Comput. Math. 8(5), 607\u2013647 (2008)","journal-title":"Found. Comput. Math."},{"issue":"1","key":"361_CR25","first-page":"1","volume":"2","author":"K Brown","year":"2008","unstructured":"Brown, K., Shoham, Y.: Essentials of game theory: a concise multidisciplinary introduction. Synth. Lect. Artificial Intell. Mach. Learn. 2(1), 1\u201388 (2008)","journal-title":"Synth. Lect. Artificial Intell. Mach. Learn."},{"key":"361_CR26","unstructured":"L\u00f6fberg, J.: Yalmip: A toolbox for modeling and optimization in matlab. Presented at the (2004)"},{"issue":"1","key":"361_CR27","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF01753710","volume":"19","author":"J Mamer","year":"1990","unstructured":"Mamer, J., Schilling, K.: Finite approximations to a zero-sum game with incomplete information. Int. J. Game Theory 19(1), 101\u2013106 (1990)","journal-title":"Int. J. Game Theory"},{"issue":"3","key":"361_CR28","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1007\/s00521-016-2706-9","volume":"30","author":"A Megahed","year":"2018","unstructured":"Megahed, A.: A differential game related to terrorism: min-max zero-sum two persons differential game. Neural Comput. Appl. 30(3), 865\u2013870 (2018)","journal-title":"Neural Comput. Appl."},{"issue":"2","key":"361_CR29","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"K Murty","year":"1987","unstructured":"Murty, K., Kabadi, S.: Some NP-complete problems in quadratic and nonlinear programming. Math. Program. 39(2), 117\u2013129 (1987)","journal-title":"Math. Program."},{"issue":"1","key":"361_CR30","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s10957-009-9522-7","volume":"142","author":"A Nedi\u0107","year":"2009","unstructured":"Nedi\u0107, A., Ozdaglar, A.: Subgradient methods for saddle-point problems. J. Optim. Theory Appl. 142(1), 205\u2013228 (2009)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"361_CR31","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"A Nemirovski","year":"2004","unstructured":"Nemirovski, A.: Prox-method with rate of convergence $$o(1\/t)$$ for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM J. Optim. 15(1), 229\u2013251 (2004)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"361_CR32","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/s10107-005-0672-6","volume":"106","author":"J Nie","year":"2006","unstructured":"Nie, J., Demmel, J., Sturmfels, B.: Minimizing polynomials via sum of squares over the gradient ideal. Math. Program. 106(3), 587\u2013606 (2006)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"361_CR33","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s10107-012-0589-9","volume":"142","author":"J Nie","year":"2013","unstructured":"Nie, J.: Certifying convergence of Lasserre\u2019s hierarchy via flat truncation. Math. Program. 142(1\u20132), 485\u2013510 (2013)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"361_CR34","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-011-0489-4","volume":"137","author":"J Nie","year":"2013","unstructured":"Nie, J.: An exact Jacobian SDP relaxation for polynomial optimization. Math. Program. 137(1\u20132), 225\u2013255 (2013)","journal-title":"Math. Program."},{"issue":"3","key":"361_CR35","doi-asserted-by":"publisher","first-page":"1634","DOI":"10.1137\/120898772","volume":"23","author":"J Nie","year":"2013","unstructured":"Nie, J.: Polynomial optimization with real varieties. SIAM J. Optim. 23(3), 1634\u20131646 (2013)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"361_CR36","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s10107-014-0845-2","volume":"151","author":"J Nie","year":"2015","unstructured":"Nie, J.: The hierarchy of local minimums in polynomial optimization. Math. Program. 151(2), 555\u2013583 (2015)","journal-title":"Math. Program."},{"issue":"2","key":"361_CR37","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10107-014-0797-6","volume":"153","author":"J Nie","year":"2015","unstructured":"Nie, J.: Linear optimization with cones of moments and nonnegative polynomials. Math. Program. 153(2), 247\u2013274 (2015)","journal-title":"Math. Program."},{"key":"361_CR38","unstructured":"Nie, J., Yang, Z., Zhou, G.: The saddle point problem of polynomials. arXiv preprint, p. 1809.01218 (2018)"},{"key":"361_CR39","unstructured":"Pascanu, R., Dauphin, Y., Ganguli, S., Bengio, Y.: On the saddle point problem for non-convex optimization. Presented at the (2014)"},{"issue":"2","key":"361_CR40","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1137\/S0895479800375540","volume":"24","author":"M Rozlozn\u00edk","year":"2002","unstructured":"Rozlozn\u00edk, M., Simoncini, V.: Krylov subspace methods for saddle point problems with indefinite preconditioning. SIAM J. Matrix Anal. Appl. 24(2), 368\u2013391 (2002)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"361_CR41","unstructured":"Singh, S., Kearns, M., Mansour, Y.: Nash convergence of gradient dynamics in general-sum games. In UAI, pp. 541\u2013548 (2000)"},{"issue":"1\u20134","key":"361_CR42","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"J Sturm","year":"1999","unstructured":"Sturm, J.: Using sedumi 1.02, a matlab toolbox for optimization over symmetric cones. Optim. Methods Softw. 11(1\u20134), 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"key":"361_CR43","doi-asserted-by":"crossref","unstructured":"Toh, K., Todd, M., T\u00fct\u00fcnc\u00fc, R.: On the implementation and usage of SDPT3\u2013a matlab software package for semidefinite-quadratic-linear programming, Version 4.0, pp. 715\u2013754, Springer (2012)","DOI":"10.1007\/978-1-4614-0769-0_25"},{"issue":"3","key":"361_CR44","doi-asserted-by":"publisher","first-page":"113","DOI":"10.3103\/S0278641910030039","volume":"34","author":"F Vasilyev","year":"2010","unstructured":"Vasilyev, F., Khoroshilova, E., Antipin, A.: An extragradient method for finding the saddle point in an optimal control problem. Mosc. Univ. Comput. Math. Cybern. 34(3), 113\u2013118 (2010)","journal-title":"Mosc. Univ. Comput. Math. Cybern."},{"key":"361_CR45","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1007\/s10589-019-00141-6","volume":"75","author":"G Zhou","year":"2020","unstructured":"Zhou, G., Wang, Q., Zhao, W.: Saddle points of rational functions. Comput. Optim. Appl. 75, 817\u2013832 (2020)","journal-title":"Comput. Optim. Appl."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00361-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-022-00361-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00361-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,9]],"date-time":"2022-04-09T12:07:38Z","timestamp":1649506058000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-022-00361-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,14]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["361"],"URL":"https:\/\/doi.org\/10.1007\/s10589-022-00361-3","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,14]]},"assertion":[{"value":"6 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}