{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T05:31:47Z","timestamp":1649136707473},"reference-count":22,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Control"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1016\/s0947-3580(12)70946-9","type":"journal-article","created":{"date-parts":[[2013,6,5]],"date-time":"2013-06-05T19:06:42Z","timestamp":1370459202000},"page":"249-256","source":"Crossref","is-referenced-by-count":0,"title":["A Decomposition Algorithm for KYP-SDPs"],"prefix":"10.1016","volume":"18","author":[{"given":"Rikard","family":"Falkeborn","sequence":"first","affiliation":[]},{"given":"Anders","family":"Hansson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"9","key":"10.1016\/S0947-3580(12)70946-9_bib1","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1145\/361573.361582","article-title":"Solution of the matrix equation AX + XB = C [f4]","volume":"15","author":"Bartels","year":"1972","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0947-3580(12)70946-9_bib2","series-title":"Nonlinear programming","author":"Bertsekas","year":"1999"},{"key":"10.1016\/S0947-3580(12)70946-9_bib3","article-title":"Linear matrix inequalities in system and control theory, volume 15 of Studies in Applied Mathematics","author":"Boyd","year":"1994","journal-title":"SIAM"},{"key":"10.1016\/S0947-3580(12)70946-9_bib4","series-title":"Linear controller design: limits of performance.","author":"Boyd","year":"1991"},{"key":"10.1016\/S0947-3580(12)70946-9_bib5","series-title":"Convex Optimization","author":"Boyd","year":"2004"},{"issue":"1","key":"10.1016\/S0947-3580(12)70946-9_bib6","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF01386389","article-title":"Newton's method for convex programming and Tchebycheff approximation","volume":"1","author":"Cheney","year":"1959","journal-title":"Numerische Mathematik"},{"key":"10.1016\/S0947-3580(12)70946-9_bib7","series-title":"33rd Annual Conference of the IEEE Industrial Electronics Society (IECON)","first-page":"493","article-title":"A case study of the multiobjective H2\/H\u221e control via finite dimensional youla parameterization and LMI optimization","author":"Farhoodi","year":"2007"},{"issue":"3","key":"10.1016\/S0947-3580(12)70946-9_bib8","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1287\/opre.18.3.375","article-title":"Primal resource-directive approaches for optimizing nonlinear decomposable systems","volume":"18","author":"Geoffrion","year":"1970","journal-title":"Operations Research"},{"key":"10.1016\/S0947-3580(12)70946-9_bib9","series-title":"Proceedings of the IEEE American Control Conference","first-page":"3244","article-title":"Multiobjective H2\/H\u221e-optimal control via finite dimensional Q-parametrization and linear matrix inequalities","author":"Hindi","year":"1998"},{"issue":"2","key":"10.1016\/S0947-3580(12)70946-9_bib10","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.automatica.2003.09.016","article-title":"Specialized fast algorithms for IQC feasibility and optimization problems","volume":"40","author":"Kao","year":"2004","journal-title":"Automatica"},{"issue":"4","key":"10.1016\/S0947-3580(12)70946-9_bib11","first-page":"703","article-title":"The cutting plane method for solving convex programs","volume":"8","author":"Kelley","year":"1960","journal-title":"J. SIAM"},{"issue":"1","key":"10.1016\/S0947-3580(12)70946-9_bib12","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/9.62264","article-title":"Multiple objective optimal control of linear systems: the quadratic norm case","volume":"36","author":"Khargonekar","year":"1991","journal-title":"IEEE Trans. Automatic Control"},{"key":"10.1016\/S0947-3580(12)70946-9_bib13","series-title":"Optimization Theory for Large Systems MacMillan Series in Operations Research","author":"Lasdon","year":"1970"},{"key":"10.1016\/S0947-3580(12)70946-9_bib14","series-title":"Computational Combinatorial Optimization","first-page":"112","article-title":"Lagrangian relaxation","author":"Lemar\u00e9chal","year":"2001"},{"key":"10.1016\/S0947-3580(12)70946-9_bib15","series-title":"IEEE International Symposium on Computer Aided Control Systems Design","first-page":"284","article-title":"YALMIP: a toolbox for modeling and optimization in MATLAB","author":"L\u00f6fberg","year":"2004"},{"issue":"6","key":"10.1016\/S0947-3580(12)70946-9_bib16","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1109\/9.587335","article-title":"System analysis via integral quadratic constraints","volume":"42","author":"Megretski","year":"1997","journal-title":"IEEE Trans. Automatic Control"},{"key":"10.1016\/S0947-3580(12)70946-9_bib17","article-title":"Linear controller design for the NEC laser bonder via LMI optimization. Advances in Linear Matrix Inequality Methods in Control","author":"Oishi","year":"1999","journal-title":"Advances in Control and Design. SIAM"},{"issue":"1","key":"10.1016\/S0947-3580(12)70946-9_bib18","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0167-6911(95)00063-1","article-title":"On the Kalman\u2013Yakubovich\u2013Popov lemma","volume":"28","author":"Rantzer","year":"1996","journal-title":"Systems and Control Letters"},{"issue":"1","key":"10.1016\/S0947-3580(12)70946-9_bib19","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","article-title":"Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones","volume":"11","author":"Sturm","year":"1999","journal-title":"Optimization Methods and Software"},{"issue":"4","key":"10.1016\/S0947-3580(12)70946-9_bib20","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1109\/TAC.2009.2014922","article-title":"A structure exploiting preprocessor for semidefinite programs derived from the Kalman-Yakubovich-Popov lemma","volume":"54","author":"Wallin","year":"2009","journal-title":"IEEE Trans. Automatic Control"},{"issue":"2","key":"10.1016\/S0947-3580(12)70946-9_bib21","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1016\/j.automatica.2007.06.026","article-title":"A cutting plane method for solving KYP-SDPs","volume":"44","author":"Wallin","year":"2008","journal-title":"Automatica"},{"key":"10.1016\/S0947-3580(12)70946-9_bib22","series-title":"Handbook of Semidefinite Programming: Theory Algorithms, and Applications","author":"Wolkowicz","year":"2000"}],"container-title":["European Journal of Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0947358012709469?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0947358012709469?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,15]],"date-time":"2018-10-15T09:26:50Z","timestamp":1539595610000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0947358012709469"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["S0947358012709469"],"URL":"https:\/\/doi.org\/10.1016\/s0947-3580(12)70946-9","relation":{},"ISSN":["0947-3580"],"issn-type":[{"value":"0947-3580","type":"print"}],"subject":[],"published":{"date-parts":[[2012,1]]}}}