Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Theory of Combinatorial Algorithms
Prof. Emo Welzl and Prof. Bernd Gärtner
Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
| Mittagsseminar Talk Information |
Date and Time: Thursday, February 20, 2025, 12:15 pm
Duration: 30 minutes
Location: OAT S15
Speaker: Jiaqi Zheng (NUS)
In this talk, I will introduce zero-sum games over symmetric cones, a versatile framework for modeling various optimization problems in computational geometry and machine learning. Applications include minimum enclosing and intersecting balls, minimum connectors (support vector machines), and the fastest mixing Markov process problem. I will show that these games are equivalent to minimizing the largest eigenvalue over symmetric cones and present algorithms for obtaining approximate solutions.
To lay the foundation for the discussion, I will also provide background on zero-sum games, symmetric cones, and Jordan algebras.
This talk is based on joint work with Tiow-Seng Tan, Antonios Varvitsiotis, and Wayne Lin.
Upcoming talks | All previous talks | Talks by speaker | 
Upcoming talks in iCal format (beta version!)
Previous talks by year: 2026 2025 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
Information for students and suggested topics for student talks
Automatic MiSe System Software Version 1.4803M | admin login
