TU Berlin

Fachgebiet Algorithmische AlgebraPublications

Page Content

to Navigation

There is no English translation for this web page.

Search for Publication

Search for publications




All Publications

Optimization, Complexity and Invariant Theory
Citation key B-OptimizationComplexityAndInvariantTheory
Author Peter Bürgisser
Title of Book 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äser and Benjamin Monmege
Publisher Schloss Dagstuhl – Leibniz-Zentrum fü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.
Link to original publication Download Bibtex entry

Navigation

Quick Access

Schnellnavigation zur Seite über Nummerneingabe