TU Berlin

Fachgebiet Algorithmische AlgebraIn Proceedings

Inhalt des Dokuments

zur Navigation

In Proceedings

Optimization, Complexity and Invariant Theory
Zitatschlüssel B-OptimizationComplexityAndInvariantTheory
Autor Peter Bürgisser
Buchtitel 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)
Seiten 1:1–1:20
Jahr 2021
ISBN 978-3-95977-180-1
ISSN 1868-8969
DOI 10.4230/LIPIcs.STACS.2021.1
Jahrgang 187
Herausgeber Markus Bläser and Benjamin Monmege
Verlag Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Serie Leibniz International Proceedings in Informatics (LIPIcs)
Zusammenfassung 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.
Link zur Originalpublikation Download Bibtex Eintrag

Navigation

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe