{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,23]],"date-time":"2022-04-23T19:40:09Z","timestamp":1650742809118},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,12,3]],"date-time":"2014-12-03T00:00:00Z","timestamp":1417564800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s10107-014-0848-z","type":"journal-article","created":{"date-parts":[[2014,12,2]],"date-time":"2014-12-02T18:42:54Z","timestamp":1417545774000},"page":"613-637","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Approximate cone factorizations and lifts of polytopes"],"prefix":"10.1007","volume":"151","author":[{"given":"Jo\u00e3o","family":"Gouveia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pablo A.","family":"Parrilo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rekha R.","family":"Thomas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,3]]},"reference":[{"key":"848_CR1","doi-asserted-by":"crossref","unstructured":"Alizadeh, F., Goldfarb, D.: Second-order cone programming. Math. Program. 95(1), 3\u201351 (2003)","DOI":"10.1007\/s10107-002-0339-5"},{"issue":"2","key":"848_CR2","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/0022-247X(81)90138-4","volume":"83","author":"J Borwein","year":"1981","unstructured":"Borwein, J., Wolkowicz, H.: Regularizing the abstract convex program. J. Math. Anal. Appl. 83(2), 495\u2013530 (1981)","journal-title":"J. Math. Anal. Appl."},{"key":"848_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"848_CR4","doi-asserted-by":"crossref","unstructured":"Braun, G., Fiorini, S., Pokutta, S., Steurer, D.: Approximation limits of linear programs (beyond hierarchies). In: 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 480\u2013489. IEEE (2012)","DOI":"10.1109\/FOCS.2012.10"},{"key":"848_CR5","doi-asserted-by":"crossref","unstructured":"Braverman, M., Moitra, A.: An information complexity approach to extended formulations. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 19, (2012)","DOI":"10.1145\/2488608.2488629"},{"key":"848_CR6","doi-asserted-by":"crossref","first-page":"2685","DOI":"10.1016\/j.laa.2012.06.038","volume":"437","author":"N Gillis","year":"2012","unstructured":"Gillis, N., Glineur, F.: On the geometric interpretation of the nonnegative rank. Linear Algebra Its Appl. 437, 2685\u20132712 (2012)","journal-title":"Linear Algebra Its Appl."},{"issue":"2","key":"848_CR7","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1287\/moor.1120.0575","volume":"38","author":"J Gouveia","year":"2013","unstructured":"Gouveia, J., Parrilo, P.A., Thomas, R.R.: Lifts of convex sets and cone factorizations. Math. Oper. Res. 38(2), 248\u2013264 (2013)","journal-title":"Math. Oper. Res."},{"key":"848_CR8","unstructured":"Gouveia, J., Robinson, R. Z., Thomas, R. R.: Worst-Case Results for Positive Semidefinite Rank. arXiv:1305.4600 (2013)"},{"key":"848_CR9","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0024-3795(98)10032-0","volume":"284","author":"M Lobo","year":"1998","unstructured":"Lobo, M., Vandenberghe, L., Boyd, S., Lebret, H.: Applications of second-order cone programming. Linear Algebra Its Appl. 284, 193\u2013228 (1998)","journal-title":"Linear Algebra Its Appl."},{"key":"848_CR10","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior Point Polynomial Methods in Convex Programming, volume 13 of Studies in Applied Mathematics","author":"YE Nesterov","year":"1994","unstructured":"Nesterov, Y.E., Nemirovski, A.: Interior Point Polynomial Methods in Convex Programming, volume 13 of Studies in Applied Mathematics. Siam, Philadelphia (1994)"},{"key":"848_CR11","unstructured":"Pashkovich, K.: Extended Formulations for Combinatorial Polytopes. PhD thesis, Magdeburg Universit\u00e4t (2012)"},{"issue":"2","key":"848_CR12","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/moor.1060.0242","volume":"32","author":"G Pataki","year":"2007","unstructured":"Pataki, G.: On the closedness of the linear image of a closed convex cone. Math. Oper. Res. 32(2), 395\u2013412 (2007)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"848_CR13","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.jmaa.2012.10.033","volume":"400","author":"G Pataki","year":"2013","unstructured":"Pataki, G.: On the connection of facially exposed and nice cones. J. Math. Anal. Appl. 400(1), 211\u2013221 (2013)","journal-title":"J. Math. Anal. Appl."},{"issue":"1","key":"848_CR14","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10208-004-0136-z","volume":"6","author":"J Renegar","year":"2006","unstructured":"Renegar, J.: Hyperbolic programs, and their derivative relaxations. Found. Comput. Math. 6(1), 59\u201379 (2006)","journal-title":"Found. Comput. Math."},{"key":"848_CR15","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis. Princeton Mathematical","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton Mathematical, vol. 28. Princeton University Press, Princeton (1970)"},{"key":"848_CR16","doi-asserted-by":"crossref","unstructured":"Saunderson, J., Parrilo, P.A.: Polynomial-sized semidefinite representations of derivative relaxations of spectrahedral cones. Math. Program. Ser. A. (2014). doi: 10.1007\/s10107-014-0804-y","DOI":"10.1007\/s10107-014-0804-y"},{"key":"848_CR17","doi-asserted-by":"crossref","unstructured":"Sonnevend, Gy.: An \u201canalytical centre\u201d for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming. In: System Modelling and Optimization, pp. 866\u2013875. Springer, Berlin (1986)","DOI":"10.1007\/BFb0043914"},{"issue":"2","key":"848_CR18","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF02592088","volume":"72","author":"JF Sturm","year":"1996","unstructured":"Sturm, J.F., Zhang, S.: An $${O(\\sqrt{n L})}$$ O ( n L ) iteration bound primal-dual cone affine scaling algorithm for linear programming. Math. Program. 72(2), 177\u2013194 (1996)","journal-title":"Math. Program."},{"issue":"3","key":"848_CR19","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/0022-0000(91)90024-Y","volume":"43","author":"M Yannakakis","year":"1991","unstructured":"Yannakakis, M.: Expressing combinatorial optimization problems by linear programs. J. Comput. Syst. Sci. 43(3), 441\u2013466 (1991)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0848-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-014-0848-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0848-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,23]],"date-time":"2022-04-23T19:02:13Z","timestamp":1650740533000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-014-0848-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,3]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["848"],"URL":"https:\/\/doi.org\/10.1007\/s10107-014-0848-z","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,3]]}}}