BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260921T104316Z
UID:Seminar-dept-1027@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20230228T130000
DTEND:20230228T140000
SUMMARY:School Seminar Series
DESCRIPTION:Prof. Raphaël Jungers: Path-complete Lyapunov functions: graph-theory and algebraic geometry for controlling complex systems\n\nI'll present recent results on Path-Complete control, a meta-optimization technique aiming at designing efficient optimization programs, initially introduced for stability analysis, but later generalized to other control problems. These optimization programs are conveniently represented by an automaton. While we understand correctly now the characterization of all valid automata for stability analysis, many elementary questions remain open.\n\n\n\nFor practical purpose, it is crucial to understand when a particular optimization program is less conservative than another one. I'll focus on this problem, which is essentially an algebraic geometry problem. I will mention recent advances, which take into account the used template of candidate Lyapunov functions in the comparison problem. We solve the problem for several templates, making use of tools from automata theory (simulation,...), graph theory (Hall's marriage theorem), and convex geometry (duality,...).\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1027
LOCATION:Ashton Lecture Theatre
END:VEVENT
END:VCALENDAR