{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T23:39:36Z","timestamp":1729640376456,"version":"3.28.0"},"reference-count":57,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1109\/focs.2019.00055","type":"proceedings-article","created":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T18:49:16Z","timestamp":1578422956000},"page":"845-861","source":"Crossref","is-referenced-by-count":12,"title":["Towards a Theory of Non-Commutative Optimization: Geodesic 1st and 2nd Order Methods for Moment Maps and Polytopes"],"prefix":"10.1109","author":[{"given":"Peter","family":"Burgisser","sequence":"first","affiliation":[]},{"given":"Cole","family":"Franks","sequence":"additional","affiliation":[]},{"given":"Ankit","family":"Garg","sequence":"additional","affiliation":[]},{"given":"Rafael","family":"Oliveira","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Walter","sequence":"additional","affiliation":[]},{"given":"Avi","family":"Wigderson","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808695"},{"key":"ref38","first-page":"1093","article-title":"A polynomial algorithm in linear programming","volume":"244","author":"khachiyan","year":"1979","journal-title":"Doklady Academii Nauk SSSR"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/BF01444162"},{"key":"ref32","first-page":"177","article-title":"Sur l’image de l’application moment","volume":"1296","author":"brion","year":"1987","journal-title":"Séminaire d’algebre Paul Dubreil et Marie-Paule Malliavin ser Lecture Notes in Mathematics"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-00-00865-X"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1090\/gsm\/184"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0066647"},{"journal-title":"Algorithms in Invariant Theory","year":"2008","author":"sturmfels","key":"ref36"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48422-7"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-00095-3"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/BF01398933"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1112\/blms\/14.1.1"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BF01388838"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055458"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.95"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1090\/jams\/864"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.06.003"},{"key":"ref21","article-title":"The deflation-inflation method for certain semidefinite programming and maximum determinant completion problems","author":"gurvits","year":"1998","journal-title":"NECI Technical Report"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132578"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.24033\/asens.1254"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.2307\/2374395"},{"key":"ref50","first-page":"1617","article-title":"First-order methods for geodesically convex optimization","author":"zhang","year":"2016","journal-title":"Conference on Learning Theory"},{"key":"ref51","first-page":"4592","article-title":"Riemannian SVRG: Fast stochastic optimization on Riemannian manifolds","author":"zhang","year":"2016","journal-title":"Advances in neural information processing systems"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1137\/15M1048859"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798367892"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/S1570-7954(06)80006-9"},{"journal-title":"Cohomology of Quotients in Symplectic and Algebraic Geometry","year":"1984","author":"kirwan","key":"ref54"},{"article-title":"Towards Riemannian accelerated gradient methods","year":"2018","author":"zhang","key":"ref53"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1137\/17M1116787"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.87"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-016-0143-x"},{"article-title":"Combinatorial and algorithmic aspects of hyperbolic polynomials","year":"2004","author":"gurvits","key":"ref40"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2017.01.018"},{"key":"ref13","article-title":"Constructive non-commutative rank computation is in deterministic polynomial time","author":"ivanyos","year":"2017","journal-title":"Proceedings of Innovations in Theoretical Computer Science (ITCS 2017)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-99-00299-4"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10801-011-0325-1"},{"key":"ref16","doi-asserted-by":"crossref","DOI":"10.46298\/dmtcs.2749","article-title":"A max-flow algorithm for positivity of Littlewood-Richardson coe?cients","author":"b\u00fcrgisser","year":"2009","journal-title":"Discrete Mathematics & Theoretical Computer Science"},{"key":"ref17","article-title":"The Paulsen problem made simple","author":"hamilton","year":"2018","journal-title":"Proceedings of Innovations in Theoretical Computer Science (ITCS 2019)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-004-0182-6"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.15"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188932"},{"key":"ref3","article-title":"Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory","author":"b\u00fcrgisser","year":"2017","journal-title":"Proceedings of Innovations in Theoretical Computer Science (ITCS 2018)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188942"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188794"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00088"},{"journal-title":"Optimization Algorithms on Matrix Manifolds","year":"2009","author":"absil","key":"ref49"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.88"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s10559-007-0023-0"},{"article-title":"Algorithms for orbit closure separation for invariants and semi-invariants of matrices","year":"2018","author":"derksen","key":"ref45"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-8390-9"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276880"},{"key":"ref42","article-title":"Computing maximum entropy distributions everywhere","author":"straszak","year":"2019","journal-title":"Proceedings of Machine Learning Research 32nd Annual Conference on Learning Theory"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591803"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40328-6_37"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-005-0188-8"}],"event":{"name":"2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)","start":{"date-parts":[[2019,11,9]]},"location":"Baltimore, MD, USA","end":{"date-parts":[[2019,11,12]]}},"container-title":["2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8936052\/8948505\/08948621.pdf?arnumber=8948621","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T06:24:05Z","timestamp":1665383045000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8948621\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11]]},"references-count":57,"URL":"https:\/\/doi.org\/10.1109\/focs.2019.00055","relation":{},"subject":[],"published":{"date-parts":[[2019,11]]}}}