BEGIN:VCALENDAR
VERSION:2.0
METHOD:PUBLISH
CALSCALE:GREGORIAN
PRODID:-//WordPress - MECv6.5.6//EN
X-ORIGINAL-URL:https://cmc.deusto.eus/
X-WR-CALNAME:cmc.deusto.eus
X-WR-CALDESC:DeustoCCM - Chair of Computational Mathematics at University of Deusto
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-PUBLISHED-TTL:PT1H
X-MS-OLK-FORCEINSPECTOROPEN:TRUE
BEGIN:VEVENT
CLASS:PUBLIC
UID:MEC-fdf0ac71ca479e1beaeed369d67aec38@cmc.deusto.eus
DTSTART:20240208T103000Z
DTEND:20240208T113000Z
DTSTAMP:20251031T222800Z
CREATED:20251031
LAST-MODIFIED:20251031
PRIORITY:5
TRANSP:OPAQUE
SUMMARY:Non-convex aggregative optimization problems and their mean-field relaxation
DESCRIPTION:Next Thursday February 08, 2023:\nOrganized by: FAU DCN-AvH, Chair for Dynamics, Control, Machine Learning and Numerics – Alexander von Humboldt Professorship at FAU, Friedrich-Alexander-Universität Erlangen-Nürnberg (Germany)\nTitle: Non-convex aggregative optimization problems and their mean-field relaxation\nSpeaker: Kang Liu ( https://dcn.nat.fau.eu/kang-liu/ )\nAffiliation: FAU DCN-AvH Chair for Dynamics, Control, Machine Learning and Numerics – Alexander von Humboldt Professorship.\nAbstract.  We address a large-scale and non-convex optimization problem, involving an aggregative term. This term can be interpreted as the sum of the contributions of N agents to some common good, with N large. We investigate a relaxation of this problem, obtained by randomization. The relaxation gap is proved to have an order O(1/N). Introducing a stochastic variant of the Frank-Wolfe algorithm (SFW), we establish its sublinear convergence rate towards the primal problem, both in expectation and probability contexts. In the subsequent segment, we extend this relaxation concept to encompass scenarios with an infinite number of agents, resulting in the formulation of the mean-field optimization problem (MFO). We ascertain the stability of MFO, enabling the application of the SFW algorithm to obtain solutions for the Lagrangian discretization of MFO problems.\nWHEN\nThu. February 08, 2023 at 11:30H\nWHERE\nFAU. Friedrich-Alexander-Universität Erlangen-Nürnberg\nOn-site. Room 01.019. Elektrotechnik building\n_\nDon’t miss out our last news and connect with us!\nhttps://dcn.nat.fau.eu/events/ ( https://dcn.nat.fau.eu/events/ )\nLinkedIn | Twitter | Instagram\n
URL:https://cmc.deusto.eus/events-calendar/non-convex-aggregative-optimization-problems-and-their-mean-field-relaxation/
ORGANIZER;CN=FAU DCN-AvH:MAILTO:
CATEGORIES:FAU DCN-AvH Jr. Seminar
ATTACH;FMTTYPE=image/png:https://cmc.deusto.eus/wp-content/uploads/FAUDCNAvHJrSeminar-kLiu-08feb2024.png
END:VEVENT
END:VCALENDAR