BEGIN:VCALENDAR
VERSION:2.0
METHOD:PUBLISH
CALSCALE:GREGORIAN
PRODID:-//WordPress - MECv7.32.0//EN
X-ORIGINAL-URL:https://www.cmm.uchile.cl/
X-WR-CALNAME:CMM
X-WR-CALDESC:Centro de Modelamiento Matemático
X-WR-TIMEZONE:America/Santiago
BEGIN:VTIMEZONE
TZID:America/Santiago
X-LIC-LOCATION:America/Santiago
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0400
TZNAME:-04
DTSTART:20260815T094336
END:STANDARD
END:VTIMEZONE
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-PUBLISHED-TTL:PT1H
X-MS-OLK-FORCEINSPECTOROPEN:TRUE
BEGIN:VEVENT
CLASS:PUBLIC
UID:MEC-9ad35b0090051b23f9b2534472cc37a6@cmm.uchile.cl
DTSTART;TZID=America/Santiago:20260818T140000
DTEND;TZID=America/Santiago:20260818T160000
DTSTAMP:20260813T122449Z
CREATED:20260813
LAST-MODIFIED:20260813
PRIORITY:5
SEQUENCE:2
TRANSP:OPAQUE
SUMMARY:SIPO: Structured nonconvex optimisation: theory, algorithms and applications
DESCRIPTION:Abstract:\nOptimisation lies at the foundation of applied mathematics, providing the quantitative framework for selecting an optimal decision from a set of candidate solutions. For decades, the field has primarily relied on convex models, yielding clean theoretical convergence guarantees and reliable numerical algorithms. However, modern machine learning applications frequently give rise to loss functions that are intrinsically nonconvex. In these settings, traditional convex paradigms fall short, requiring novel algorithmic strategies tailored to nonconvex problems.\nIn this talk, we explore optimisation methods designed for nonconvex problems that explicitly exploit the underlying structure of the models. In particular, we will cover splitting methods, a family of algorithms that decompose complex models into simpler, computationally tractable subproblems. We will also discuss the central theoretical and practical difficulties inherent in solving nonconvex problems. These include the necessity of settling for stationary points or local minimisers rather than global optima, as well as pathological convergence issues, such as conservative stepsizes that may stall the iterative process. Finally, we will present recent developments aimed at overcoming these bottlenecks, illustrating how structure-exploiting algorithms bridge the gap between rigorous mathematical theory and practical numerical performance.\nSpeaker: Felipe Atenas (CMM, U. de Chile)\n
URL:https://www.cmm.uchile.cl/events/sipo-structured-nonconvex-optimisation-theory-algorithms-and-applications/
ORGANIZER;CN=CMM:MAILTO:
CATEGORIES:Seminarios
LOCATION:Sala John Von Neumann, 7th floor, Beauchef 851
ATTACH;FMTTYPE=image/jpeg:https://www.cmm.uchile.cl/wp-content/uploads/2026/06/3d-render-modern-network-communications-background-with-plexus-design-scaled.jpg
END:VEVENT
END:VCALENDAR