{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T01:01:09Z","timestamp":1790384469729,"version":"4.1.0"},"reference-count":16,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Matrix Anal. Appl."],"published-print":{"date-parts":[[2009,1]]},"abstract":"<jats:p>An elimination problem in semidefinite programming is solved by means of tensor algebra. It concerns families of matrix cube problems whose constraints are the minimum and maximum eigenvalue functions on an affine space of symmetric matrices. A linear matrix inequality (LMI) representation is given for the convex set of all feasible instances, and its boundary is studied from the perspective of algebraic geometry. This generalizes the known LMI representations of k-ellipses and k-ellipsoids.<\/jats:p>","DOI":"10.1137\/080722606","type":"journal-article","created":{"date-parts":[[2009,6,26]],"date-time":"2009-06-26T18:06:20Z","timestamp":1246039580000},"page":"755-766","source":"Crossref","is-referenced-by-count":7,"title":["Matrix Cubes Parameterized by Eigenvalues"],"prefix":"10.1137","volume":"31","author":[{"given":"Jiawang","family":"Nie","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernd","family":"Sturmfels","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2009,6,26]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"S. Basu, R. Pollack, and M.F. Roy,\n                      Algorithms in Real Algebraic Geometry\n                      , Springer-Verlag, Berlin, 2006.","DOI":"10.1007\/3-540-33099-2"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"S. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan,\n                      Linear Matrix Inequalities in System and Control Theory\n                      , SIAM Stud. Appl. Math. 15, SIAM, Philadelphia, 1994.","DOI":"10.1137\/1.9781611970777"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1287\/moor.23.4.769"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1287\/moor.28.3.497.16392"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"B.D. Chen and S. Lall,\n                      Degree bounds for polynomial verification of the matrix cube problem\n                      , in Proceedings of the 45th IEEE Conference on Decision and Control, SanDiego, CA, 2006, IEEE Press, Piscataway NJ, 2006, pp. 4405\u20134410.","DOI":"10.1109\/CDC.2006.376783"},{"key":"R6","unstructured":"J. W. Helton and J. Nie,\n                      Semidefinite representation of convex sets\n                      , Math. Program., to appear."},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1137\/07070526X"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20155"},{"key":"R9","unstructured":"R. A. Horn and C. R. Johnson,\n                      Topics in Matrix Analysis\n                      , Cambridge University Press, Cambridge, UK, 1994."},{"key":"R10","unstructured":"S. Lang,\n                      Algebra\n                      , 3rd ed., Springer-Verlag, New York, 2000."},{"key":"R11","unstructured":"A. Nemirovski,\n                      The Matrix Cube Problem: Approximations and Applications\n                      , lecture notes, 2001, available online at http:\/\/www2.isye.gatech.edu\/~nemirovs\/."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"J. Nie, P. Parrilo, and B. Sturmfels,\n                      Semidefinite representation of the k-ellipse\n                      , in Algorithms in Algebraic Geometry, IMA Vol. Math. Appl. 146, A. Dickenstein, F.O. Schreyer, and A. Sommese, eds., Springer, New York, 2008, pp. 117\u2013132.","DOI":"10.1007\/978-0-387-75155-9_7"},{"key":"R13","unstructured":"J. Nie, K. Ranestad, and B. Sturmfels,\n                      The algebraic degree of semidefinite programming\n                      , Math. Program., to appear."},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01100204"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1080\/10556789908805766"},{"key":"R16","doi-asserted-by":"crossref","unstructured":"H. Wolkowicz, R. Saigal, and L. Vandenberghe, eds.\n                      Handbook of Semidefinite Programming: Theory, Algorithms, and Applications\n                      , Kluwer Academic Publishers, Dordrecht, The Netherlands, 2000.","DOI":"10.1007\/978-1-4615-4381-7"}],"container-title":["SIAM Journal on Matrix Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/080722606","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:45:29Z","timestamp":1787334329000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/080722606"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["10.1137\/080722606"],"URL":"https:\/\/doi.org\/10.1137\/080722606","relation":{},"ISSN":["0895-4798","1095-7162"],"issn-type":[{"value":"0895-4798","type":"print"},{"value":"1095-7162","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1]]}}}