BEGIN:VCALENDAR
PRODID:-//Ben Fortuna//iCal4j 1.0//EN
VERSION:2.0
CALSCALE:GREGORIAN
X-WR-CALNAME:Seminar\, Optimization and systems theory
BEGIN:VEVENT
DTSTAMP:20230128T123532Z
SUMMARY:Shudian Zhao: SDP-based bounds for k-partitioning via ADMM metho
ds
DESCRIPTION:Abstract: In this presentation\, we investigate the quality o
f semidefinite relaxations strengthened by nonnegativity inequalities an
d polyhedral cuts for the NP-hard k-equipartition problem. The k-equipar
tition problem asks to partition an undirected graph into k disjointed g
roups equally such that the total weight of edges cut by this partition
is minimized. To solve the relaxations\, we introduce two variants of th
e alternating direction method of multipliers (ADMM). Numerical experim
ents demonstrate that we find high quality bounds with reasonable comput
ational costs even for large benchmark instances with up to 1000 vertice
s.
LOCATION:KTH\, 3418
DTSTART:20220831T090000Z
DTEND:20220831T100000Z
UID:c738afab-494b-4312-af83-e503be47dfc8
END:VEVENT
END:VCALENDAR