{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T16:10:16Z","timestamp":1769875816702,"version":"3.49.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/cdc.2004.1428957","type":"proceedings-article","created":{"date-parts":[[2008,8,27]],"date-time":"2008-08-27T18:10:36Z","timestamp":1219860636000},"page":"3154-3159","source":"Crossref","is-referenced-by-count":31,"title":["From coefficients to samples: a new approach to SOS optimization"],"prefix":"10.1109","author":[{"given":"J.","family":"Lofberg","sequence":"first","affiliation":[]},{"given":"P.A.","family":"Parrilo","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","author":"prajna","year":"2002","journal-title":"SOSTOOLS Sum of squares optimization toolbox for Matlab"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0387-5"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2003.1243743"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2003.1272305"},{"key":"16","author":"parrilo","year":"2000","journal-title":"Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization"},{"key":"13","year":"1998","journal-title":"Real Computation and Complexity"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2002.1184414"},{"key":"11","volume":"3","author":"lo?fberg","year":"2004","journal-title":"YALMIP"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1999.0530"},{"key":"3","volume":"65","author":"de klerk","year":"2002","journal-title":"Aspects of Semidefinite Programming Interior Point Algorithms and Selected Applications Volume 65 of Applied Optimization"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1137\/1038003"},{"key":"2","author":"benson","year":"0","journal-title":"DSDP a Dual Scaling Algorithm for Positive Semidefinite Programming"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0334-x"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623400366802"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018981505752"},{"key":"6","article-title":"Positive polynomials in control","author":"garulli","year":"2004","journal-title":"Springer Lecture Notes in Computer Science"},{"key":"5","author":"fiacco","year":"1968","journal-title":"Nonlinear Programming Sequential Unconstrained Minimization Techniques"},{"key":"4","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-1134-8","author":"den hertog","year":"1994","journal-title":"Interior Point Approach to Linear Quadratic and Convex Programming Algorithms and Complexity"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2003.1272309"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479803374840"}],"event":{"name":"2004 43rd IEEE Conference on Decision and Control (CDC)","location":"Nassau","start":{"date-parts":[[2004,12,14]]},"end":{"date-parts":[[2004,12,17]]}},"container-title":["2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9774\/30837\/01428957.pdf?arnumber=1428957","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T11:16:02Z","timestamp":1497784562000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1428957\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/cdc.2004.1428957","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}