@inproceedings{B-OptimizationComplexityAndInvariantTheory,
Title = {Optimization, Complexity and Invariant Theory},
Author = {Peter B\"{u}rgisser},
Booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
Pages = {1:1--1:20},
Year = {2021},
Isbn = {978-3-95977-180-1},
Issn = {1868-8969},
Doi = {10.4230/LIPIcs.STACS.2021.1},
Volume = {187},
Editor = {Markus Bl\"{a}ser and Benjamin Monmege},
Publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
Abstract = {Invariant and representation theory studies symmetries by means of group actions and is a well established source of unifying principles in mathematics and physics. Recent research suggests its relevance for complexity and optimization through quantitative and algorithmic questions. The goal of the talk is to give an introduction to new algorithmic and analysis techniques that extend convex optimization from the classical Euclidean setting to a general geodesic setting. We also point out surprising connections to a diverse set of problems in different areas of mathematics, statistics, computer science, and physics.},
Url2 = {https://doi.org/10.4230/LIPIcs.STACS.2021.1}
}