{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T01:21:21Z","timestamp":1706059281062},"reference-count":18,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"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":["Automatica"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1016\/s0005-1098(03)00180-8","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T11:39:35Z","timestamp":1056973175000},"page":"1773-1781","source":"Crossref","is-referenced-by-count":12,"title":["Recursive algorithms for inner ellipsoidal approximation of convex polytopes"],"prefix":"10.1016","volume":"39","author":[{"given":"Fabrizio","family":"Dabbene","sequence":"first","affiliation":[]},{"given":"Paolo","family":"Gay","sequence":"additional","affiliation":[]},{"given":"Boris","family":"T. Polyak","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0005-1098(03)00180-8_BIB1","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1016\/S0005-1098(98)00065-X","article-title":"Convergence properties of the membership set and noise model selection","volume":"34","author":"Bai","year":"1998","journal-title":"Automatica"},{"key":"10.1016\/S0005-1098(03)00180-8_BIB2","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1016\/0005-1098(90)90005-3","article-title":"Parameter estimation algorithms for a set-membership description of uncertainty","volume":"26","author":"Belforte","year":"1990","journal-title":"Automatica"},{"key":"10.1016\/S0005-1098(03)00180-8_BIB3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/acs.4480060303","article-title":"The method of recursive aim inequalities in adaptive control theory","volume":"6","author":"Bondarko","year":"1992","journal-title":"International Journal on Adaptive Control and Signal Processing"},{"key":"10.1016\/S0005-1098(03)00180-8_BIB4","series-title":"Linear matrix inequalities in systems and control theory","author":"Boyd","year":"1994"},{"key":"10.1016\/S0005-1098(03)00180-8_BIB5","doi-asserted-by":"crossref","first-page":"1755","DOI":"10.1109\/9.964685","article-title":"Stochastic algorithms for exact and approximate feasibility of robust lmis","volume":"46","author":"Calafiore","year":"2001","journal-title":"IEEE Transactions on Automatic Control"},{"key":"10.1016\/S0005-1098(03)00180-8_BIB6","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1023\/A:1011978200643","article-title":"Multi-input multi-output ellipsoidal state bounding","volume":"111","author":"Durieu","year":"2001","journal-title":"Journal of Optimization Theory and Application"},{"key":"10.1016\/S0005-1098(03)00180-8_BIB7","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0005-1098(82)90110-8","article-title":"On the value of information in system identification\u2014bounded noise case","volume":"18","author":"Fogel","year":"1982","journal-title":"Automatica"},{"key":"10.1016\/S0005-1098(03)00180-8_BIB8","series-title":"The advanced theory of statistics","author":"Kendall","year":"1977"},{"key":"10.1016\/S0005-1098(03)00180-8_BIB9","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF01582144","article-title":"On the complexity of approximating the maximal inscribed ellipsoid for a polytope","volume":"61","author":"Khachiyan","year":"1990","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0005-1098(03)00180-8_BIB10","doi-asserted-by":"crossref","unstructured":"Mo, S. H., & Norton, J. P. (1990). Fast and robust algorithm to compute exact polytope parameter bounds. Maths. & Computers in Simulation 32, 481\u2013493.","DOI":"10.1016\/0378-4754(90)90004-3"},{"key":"10.1016\/S0005-1098(03)00180-8_BIB11","series-title":"Interior-point polynomial algorithms in convex programming","author":"Nesterov","year":"1994"},{"key":"10.1016\/S0005-1098(03)00180-8_BIB12","first-page":"593","article-title":"A general method for solving extremum problems","volume":"3","author":"Polyak","year":"1967","journal-title":"Soviet Mathematics Doklady"},{"key":"10.1016\/S0005-1098(03)00180-8_BIB13","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-6911(01)00117-7","article-title":"Probabilistic robust design with linear quadratic regulators","volume":"43","author":"Polyak","year":"2001","journal-title":"System and Control Letters"},{"key":"10.1016\/S0005-1098(03)00180-8_BIB14","doi-asserted-by":"crossref","unstructured":"Pronzato, L., & Walter, E. (1996). Volume-optimal inner and outer ellipsoids. In M. Milanese et al. (Eds.), Bounding approaches to system identification, New York: Plenum Press, pp 119\u2013138.","DOI":"10.1007\/978-1-4757-9545-5_8"},{"key":"10.1016\/S0005-1098(03)00180-8_BIB15","unstructured":"Saigal, R., Vanderberghe, L., & Wolkowicz, H. (Eds.). (2000). Handbook of semidefinite programming. Waterloo: Kluwer Academic Publishers."},{"key":"10.1016\/S0005-1098(03)00180-8_BIB16","first-page":"226","article-title":"The method of inscribed ellipsoids","volume":"37","author":"Tarasov","year":"1988","journal-title":"Soviet Mathematics Doklady"},{"key":"10.1016\/S0005-1098(03)00180-8_BIB17","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/S0168-9274(98)00098-1","article-title":"Applications of semidefinite programming","volume":"29","author":"Vandenberghe","year":"1999","journal-title":"Applied Numerical Mathematics"},{"key":"10.1016\/S0005-1098(03)00180-8_BIB18","doi-asserted-by":"crossref","first-page":"1570","DOI":"10.1109\/43.256932","article-title":"Ellipsoidal method for design centering and yield estimation","volume":"12","author":"Wojciechowski","year":"1993","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"}],"container-title":["Automatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0005109803001808?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0005109803001808?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:53:31Z","timestamp":1552917211000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0005109803001808"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":18,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["S0005109803001808"],"URL":"https:\/\/doi.org\/10.1016\/s0005-1098(03)00180-8","relation":{},"ISSN":["0005-1098"],"issn-type":[{"value":"0005-1098","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}