{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T17:47:21Z","timestamp":1648576041865},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,6,21]],"date-time":"2019-06-21T00:00:00Z","timestamp":1561075200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,21]],"date-time":"2019-06-21T00:00:00Z","timestamp":1561075200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s10589-019-00118-5","type":"journal-article","created":{"date-parts":[[2019,6,21]],"date-time":"2019-06-21T15:02:22Z","timestamp":1561129342000},"page":"317-344","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems"],"prefix":"10.1007","volume":"74","author":[{"given":"Hikaru","family":"Komeiji","sequence":"first","affiliation":[]},{"given":"Sunyoung","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Makoto","family":"Yamashita","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,21]]},"reference":[{"key":"118_CR1","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/BF02771790","volume":"153","author":"G Blekherman","year":"2006","unstructured":"Blekherman, G.: There are significantly more nonnegative polynomials than sums of squares. Isr. J. Math. 153, 355\u2013380 (2006)","journal-title":"Isr. J. Math."},{"key":"118_CR2","doi-asserted-by":"crossref","unstructured":"Chua, L., Plaumann, D., Sinn, R., Vinzant, C.: Gram spectrahedra. \n                    arXiv:1608.00234v2\n                    \n                   (2016)","DOI":"10.1090\/conm\/697\/14047"},{"issue":"4","key":"118_CR3","doi-asserted-by":"publisher","first-page":"2381","DOI":"10.1137\/15M1052548","volume":"27","author":"D Cifuentes","year":"2017","unstructured":"Cifuentes, D., Parrilo, P.A.: Sampling algebraic varieties for sum of squares programs. SIAM J. Optim. 27(4), 2381\u20132404 (2017)","journal-title":"SIAM J. Optim."},{"issue":"11","key":"118_CR4","doi-asserted-by":"publisher","first-page":"4282","DOI":"10.1109\/TSP.2006.880218","volume":"54","author":"B Dumitrescu","year":"2006","unstructured":"Dumitrescu, B.: Trigonometric polynomials positive on frequency domains and applications to 2-D FIR filter design. IEEE Trans. Signal Process. 54(11), 4282\u20134292 (2006)","journal-title":"IEEE Trans. Signal Process."},{"key":"118_CR5","unstructured":"Fortin, M., Glowinski, R.: Augmented Lagrangian methods: applications to the numerical solution of boundary value problems. Elsevier (1983)"},{"key":"118_CR6","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1137\/S1052623400366218","volume":"11","author":"M Fukuda","year":"2000","unstructured":"Fukuda, M., Kojima, M., Murota, K., Nakata, K.: Exploiting sparsity in semidefinite programming via matrix completion. I: General framework. SIAM J. Optim. 11, 647\u2013674 (2000)","journal-title":"SIAM J. Optim."},{"key":"118_CR7","unstructured":"GLOBAL Lib. GLOBAL library. \n                    http:\/\/www.gamsworld.org\/global\/globallib.htm"},{"key":"118_CR8","unstructured":"Glowinski, R.: Lectures on numerical methods for nonlinear variational problems. In: Tata Institute of Fundamental Research Lectures on Mathematics and Physics. Notes by M.G. Vijayasundaram and M. Adimurthi, Bombay (1980)"},{"key":"118_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-010-0402-6","volume":"129","author":"S Kim","year":"2011","unstructured":"Kim, S., Kojima, M., Mevissen, M., Yamashita, M.: Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion. Math. Program. 129, 33\u201368 (2011)","journal-title":"Math. Program."},{"key":"118_CR10","doi-asserted-by":"crossref","unstructured":"L\u00f6fberg, J., Parrilo, P.A.: From coefficients to samples: a new approach to SOS optimization. In: The 43rd IEEE Conference on Decision and Control, vol. 3, pp. 3154\u20133159. IEEE (2004)","DOI":"10.1109\/CDC.2004.1428957"},{"key":"118_CR11","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1137\/070704575","volume":"20","author":"J Malick","year":"2009","unstructured":"Malick, J., Povh, J., Rendl, F., Wiegele, A.: Regularization methods for semidefinite programming. SIAM J. Optim. 20, 336\u2013356 (2009)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"118_CR12","doi-asserted-by":"publisher","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\u20132","key":"118_CR13","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."},{"key":"118_CR14","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1137\/130935112","volume":"35","author":"J Nie","year":"2014","unstructured":"Nie, J., Wang, L.: Semidefinite relaxations for best rank-1 tensor approximations. SIAM J. Matrix Anal. Appl. 35, 1155\u20131179 (2014)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"118_CR15","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10107-003-0387-5","volume":"96","author":"P Parrilo","year":"2003","unstructured":"Parrilo, P.: Semidefinite programming relaxations for semialgebraic problems. Math. Program. 96(2), 293\u2013320 (2003)","journal-title":"Math. Program."},{"key":"118_CR16","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.tcs.2008.09.025","volume":"409","author":"H Peyrl","year":"2008","unstructured":"Peyrl, H., Parrilo, P.A.: Computing sum of squares decompositions with rational coefficients. Theor. Comput. Sci. 409, 269\u2013281 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"118_CR17","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s00607-006-0182-2","volume":"78","author":"J Povh","year":"2006","unstructured":"Povh, J., Rendl, F., Wiegele, A.: A boundary point method to solve semidefinite programs. Computing 78, 277\u2013286 (2006)","journal-title":"Computing"},{"issue":"4","key":"118_CR18","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1109\/JSTSP.2007.910261","volume":"1","author":"T Roh","year":"2007","unstructured":"Roh, T., Dumitrescu, B., Vandenberghe, L.: Multidimensional FIR filter design via trigonometric sum-of-squares optimization. IEEE J. Sel. Top. Signal Process. 1(4), 641\u2013650 (2007)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"118_CR19","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11&12","author":"JF Sturm","year":"1999","unstructured":"Sturm, J.F.: SeDuMi 1.02: a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11&12, 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"key":"118_CR20","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1137\/140964357","volume":"25","author":"D Sun","year":"2015","unstructured":"Sun, D., Toh, K., Yang, L.: A convergent 3-block semi-proximal alternating direction method of multipliers for conic programming with 4-type constraints. SIAM J. Optim. 25, 882\u2013915 (2015)","journal-title":"SIAM J. Optim."},{"key":"118_CR21","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"RH T\u00fct\u00fcnc\u00fc","year":"2003","unstructured":"T\u00fct\u00fcnc\u00fc, R.H., Toh, K.C., Todd, M.J.: Solving semidefinite-quadratic-linear programs using SDPT3. Math. Program. 95, 189\u2013217 (2003)","journal-title":"Math. Program."},{"key":"118_CR22","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1137\/050623802","volume":"17","author":"H Waki","year":"2006","unstructured":"Waki, H., Kim, S., Kojima, M., Muramatsu, M.: Sums of squares and semidefinite programming relaxations for polynomial optimization problems with structured sparsity. SIAM J. Optim. 17, 218\u2013242 (2006)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"118_CR23","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s12532-010-0017-1","volume":"2","author":"Z Wen","year":"2010","unstructured":"Wen, Z., Goldfarb, D., Yin, W.: Alternating direction augmented Lagrangian methods for semidefinite programming. Math. Program. Comput. 2(3), 203\u2013230 (2010)","journal-title":"Math. Program. Comput."},{"key":"118_CR24","first-page":"687","volume-title":"Handbook on Semidefinite, Conic and Polynomial Optimization","author":"Makoto Yamashita","year":"2011","unstructured":"Yamashita, M., Fujisawa, K., Fukuda, M., Kobayashi, K., Nakata, K., Nakata, M.: Latest developments in the SDPA family for solving large-scale SDPs. In: M.F. Anjos, J.B. Lasserre (eds.), Handbook on Semidefinite, Conic and Polynomial Optimization, pp. 687\u2013713. Springer, Berlin (2012)"},{"issue":"4","key":"118_CR25","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1080\/1055678031000118482","volume":"18","author":"M Yamashita","year":"2003","unstructured":"Yamashita, M., Fujisawa, K., Kojima, M.: Implementation and evaluation of SDPA 6.0. Optim (semidefinite programming algorithm 6.0). Methods Softw. 18(4), 491\u2013505 (2003)","journal-title":"Methods Softw."},{"key":"118_CR26","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s12532-015-0082-6","volume":"7","author":"LQ Yang","year":"2015","unstructured":"Yang, L.Q., Sun, D.F., Toh, K.C.: SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints. Math. Program. Comput. 7, 331\u2013366 (2015)","journal-title":"Math. Program. Comput."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00118-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00118-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00118-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,19]],"date-time":"2020-06-19T23:12:43Z","timestamp":1592608363000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00118-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,21]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["118"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00118-5","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,21]]},"assertion":[{"value":"10 April 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}