{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T22:14:27Z","timestamp":1722982467321},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,2,11]],"date-time":"2009-02-11T00:00:00Z","timestamp":1234310400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2010,1]]},"DOI":"10.1007\/s10898-009-9405-3","type":"journal-article","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T06:18:41Z","timestamp":1234246721000},"page":"1-23","source":"Crossref","is-referenced-by-count":7,"title":["Solving polynomial least squares problems via semidefinite programming relaxations"],"prefix":"10.1007","volume":"46","author":[{"given":"Sunyoung","family":"Kim","sequence":"first","affiliation":[]},{"given":"Masakazu","family":"Kojima","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,2,11]]},"reference":[{"key":"9405_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4613-8369-7_1","volume-title":"Graph Theory and Sparse Matrix Computation","author":"J.R.S. Blair","year":"1993","unstructured":"Blair J.R.S., Peyton B.: An introduction to chordal graphs and clique trees. In: George A., Gilbert J.R., Liu J.W.H. (eds) Graph Theory and Sparse Matrix Computation. Springer-Verlag, New York 1\u201329 (1993)"},{"key":"9405_CR2","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1080\/10556789908805769","volume":"11&12","author":"B. Borchers","year":"1999","unstructured":"Borchers B.: SDPLIB 1.2, a library of semidefinite programming test problems. Optim. Methods Softw. 11&12, 683\u2013690 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"9405_CR3","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF01582221","volume":"67","author":"T.F. Coleman","year":"1994","unstructured":"Coleman T.F., Li Y.: On the convergence of reflective Newton methods for large-scale nonlinear minimization subject to bounds. Math. Progr. 67(2), 189\u2013224 (1994)","journal-title":"Math. Progr."},{"key":"9405_CR4","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1137\/0806023","volume":"6","author":"T.F. Coleman","year":"1996","unstructured":"Coleman T.F., Li Y.: An interior, trust region approach for nonlinear minimization subject to bounds. SIAM J. Optim. 6, 418\u2013445 (1996)","journal-title":"SIAM J. Optim."},{"key":"9405_CR5","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1090\/S0025-5718-1988-0929544-3","volume":"50","author":"A.R. Conn","year":"1988","unstructured":"Conn A.R., Gould N.I.M., Toint P.L.: Testing a class of methods for solving minimization problems with simple bounds on the variables. Math. Comp. 50, 399\u2013430 (1988)","journal-title":"Math. Comp."},{"key":"9405_CR6","unstructured":"Fujisawa, K., Kojima, M., Nakata, K.: SDPA (SemiDefinite Programming Algorithm) user\u2019s manual, Version 5.0, Research Report B-308, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Oh-Okayama, Meguro, Tokyo 152-8552, Japan (1995)"},{"key":"9405_CR7","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"N.I.M. Gould","year":"2003","unstructured":"Gould N.I.M., Orban D., Toint Ph.L.: Cuter, a constrained and unconstrained testing environment, revisited. TOMS 29, 373\u2013394 (2003)","journal-title":"TOMS"},{"key":"9405_CR8","unstructured":"Henrion, D., Lasserre, J.B.: GloptiPoly: global optimization over polynomials with Matlab and SeDuMi. Laboratoire d\u2019Analyse et d\u2019Architecture des Syst\u2018emes, Centre National de la Recherche Scientifique, 7 Avenue du Colonel Roche, 31 077 Toulouse, cedex 4, France, February (2002)"},{"issue":"2","key":"9405_CR9","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1109\/TAC.2005.863494","volume":"51","author":"D. Henrion","year":"2006","unstructured":"Henrion D., Lasserre J.B.: Convergent relaxations of polynomial matrix inequalities and static output feedback. IEEE Trans. Autom. Control 51(2), 192\u2013202 (2006)","journal-title":"IEEE Trans. Autom. Control"},{"key":"9405_CR10","unstructured":"Hol, C.W., Scherer, C.W.: Sums of squares relaxations for polynomial semi-definite programming. In: De Moor, B., Motmans, B. (eds.) Proceedings of the 16th International Symposium on Mathematical Theory of Networks and Systems. Leuven, Belgium, 5\u20139 July (2004) 1\u201310"},{"issue":"2","key":"9405_CR11","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1137\/04060562X","volume":"16","author":"D. Jibetean","year":"2005","unstructured":"Jibetean D., Laurent M.: Semidefinite approximation for global unconstrained polynomial optimization. SIAM J. Optim. 16(2), 490\u2013514 (2005)","journal-title":"SIAM J. Optim."},{"key":"9405_CR12","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1137\/030601260","volume":"15","author":"S. Kim","year":"2005","unstructured":"Kim S., Kojima M., Waki H.: Generalized Lagrangian duals and sums of squares relaxations of sparse polynomial optimization problems. SIAM J. Optim. 15, 697\u2013719 (2005)","journal-title":"SIAM J. Optim."},{"key":"9405_CR13","doi-asserted-by":"crossref","unstructured":"Kim, S., Kojima, M., Toint, Ph.L.: Recognizing underlying sparsity in Optimization. Math. Program., Ser. A. (2009). doi: 10.1007\/s10107-008-0210-4","DOI":"10.1007\/s10107-008-0210-4"},{"issue":"1","key":"9405_CR14","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s00245-007-9030-9","volume":"58","author":"K. Kobayashi","year":"2008","unstructured":"Kobayashi K., Kim S., Kojima M.: Correlative sparsity in primal-dual interior point methods for LP, SOCP and SDP. Appl. Math. Optim. 58(1), 69\u201388 (2008)","journal-title":"Appl. Math. Optim."},{"issue":"3","key":"9405_CR15","first-page":"241","volume":"51","author":"K. Kobayashi","year":"2008","unstructured":"Kobayashi K., Kim S., Kojima M.: Sparse second order cone programming approaches for convex opimitization problems. J. Oper. Res. Soc. Japan 51(3), 241\u2013264 (2008)","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"9405_CR16","unstructured":"Kojima, M.: Sums of squares relaxations of polynomial semidefinite programs. Research Report B-397, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Oh-Okayama, Meguro, Tokyo 152-8552, Japan (2003)"},{"key":"9405_CR17","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s10107-006-0004-5","volume":"110","author":"M. Kojima","year":"2007","unstructured":"Kojima M., Muramatsu M.: An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones. Math. Program. 110, 315\u2013326 (2007)","journal-title":"Math. Program."},{"issue":"1","key":"9405_CR18","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s10589-007-9112-2","volume":"42","author":"M. Kojima","year":"2009","unstructured":"Kojima M., Muramatsu M.: A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones. Comput. Optim. Appl. 42(1), 31\u201341 (2009)","journal-title":"Comput. Optim. Appl."},{"key":"9405_CR19","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s10107-004-0554-3","volume":"103","author":"M. Kojima","year":"2005","unstructured":"Kojima M., Kim S., Waki H.: Sparsity in sums of squares of polynomials. Math. Program. 103, 45\u201362 (2005)","journal-title":"Math. Program."},{"key":"9405_CR20","volume-title":"Methods for unconstrained optimization problems","author":"J.S. Kowalik","year":"1968","unstructured":"Kowalik J.S., Osborne M.R.: Methods for unconstrained optimization problems. Elseview North- Halland, New York (1968)"},{"key":"9405_CR21","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"J.B. Lasserre","year":"2001","unstructured":"Lasserre J.B.: Global optimization with polynomials and the problems of moments. SIAM J. Optim. 11, 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"9405_CR22","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1137\/05064504X","volume":"17","author":"J.B. Lasserre","year":"2006","unstructured":"Lasserre J.B.: Convergent SDP-relaxations in polynomial optimization with sparsity. SIAM J. Optim. 17(3), 822\u2013843 (2006)","journal-title":"SIAM J. Optim."},{"key":"9405_CR23","doi-asserted-by":"crossref","first-page":"251","DOI":"10.11650\/twjm\/1500407124","volume":"3","author":"T.Y. Li","year":"1999","unstructured":"Li T.Y.: Solving polynomial systems by polyhedral homotopies. Taiwan J. Math. 3, 251\u2013279 (1999)","journal-title":"Taiwan J. Math."},{"key":"9405_CR24","unstructured":"Li, T.Y.: HOM4PS in Fortran. http:\/\/www.mth.msu.edu\/~li\/"},{"key":"9405_CR25","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"J.J. More","year":"1981","unstructured":"More J.J., Garbow B.S., Hillstrom K.E.: Testing unconstrained optimization software. ACM Trans. Math. Soft. 7, 17\u201341 (1981)","journal-title":"ACM Trans. Math. Soft."},{"key":"9405_CR26","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0721052","volume":"21","author":"S.G. Nash","year":"1984","unstructured":"Nash S.G.: Newton-type minimization via the Lanczos method. SIAM J.Numer. Anal. 21, 770\u2013788 (1984)","journal-title":"SIAM J.Numer. Anal."},{"key":"9405_CR27","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer (2006)"},{"key":"9405_CR28","unstructured":"Prajna, S., Papachristodoulou, A., Parrilo, P.A.: SOSTOOLS: Sum of Squares Optimization Toolbox for MATLAB\u2014User\u2019s Guide. Control and Dynamical Systems, California Institute of Technology, Pasadena, CA 91125 USA, (2002)"},{"issue":"12","key":"9405_CR29","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"F.J. Sturm","year":"1999","unstructured":"Sturm F.J.: Using 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":"9405_CR30","unstructured":"Test suite of polynomial systems. http:\/\/www.math.uic.edu\/~jan"},{"key":"9405_CR31","volume-title":"SDPT3\u2014a MATLAB software package for semidefinite programming","author":"K. Toh","year":"1998","unstructured":"Toh K., Todd M.J., T\u00fct\u00fcnt\u00fc R.H.: SDPT3\u2014a MATLAB software package for semidefinite programming. Department of Mathematics, National University of Singapore, Singapore (1998)"},{"issue":"1","key":"9405_CR32","doi-asserted-by":"crossref","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(1), 218\u2013242 (2006)","journal-title":"SIAM J. Optim."},{"key":"9405_CR33","first-page":"2","volume":"15","author":"H. Waki","year":"2008","unstructured":"Waki H., Kim S., Kojima M., Muramatsu M.: SparsePOP : a sparse semidefinite programming relaxation of polynomial optimization problems. ACM Trans. Math. Softw. 15, 2\u201315 (2008)","journal-title":"ACM Trans. Math. Softw."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-009-9405-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-009-9405-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-009-9405-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:58:53Z","timestamp":1559278733000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-009-9405-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,11]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["9405"],"URL":"https:\/\/doi.org\/10.1007\/s10898-009-9405-3","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2,11]]}}}