BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UM//UM*Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/Detroit
TZURL:http://tzurl.org/zoneinfo/America/Detroit
X-LIC-LOCATION:America/Detroit
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20070311T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20071104T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20240905T095630
DTSTART;TZID=America/Detroit:20240905T150000
DTEND;TZID=America/Detroit:20240905T160000
SUMMARY:Workshop / Seminar:From circles and dots to separating curves in genus 2 (combinatorics seminar)
DESCRIPTION:Given 6 dots in the plane\, how many ways are there to separate them into two sets of 3 using a circle? Or using a Jordan curve? The first question can be answered by considering \"higher order Voronoi diagrams\"\; the latter can be answered by observing these diagrams have a \"plabic\" structure (in the sense of Postnikov). This gives a bijection between such Jordan curves and degree 1 cluster variables in the cluster algebra of type X7\, an exceptional cluster algebra about which little is known. This correspondence allows us to translate structure theorems about cluster algebras into remarkable results on the structure of Jordan curves with 3 dots on either side. As an application\, we translate these results into analogous results on \"separating curves in the closed surface of genus 2\"\; specifically\, we show that the g=2 separating curve complex is a strongly connected 6-dimensional pseudomanifold. On joint work with James Beyer and Jaewon Min.\n\nThis talk will take place in East Hall 4448.
UID:124001-21852274@events.umich.edu
URL:https://events.umich.edu/event/124001
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:Mathematics
LOCATION:East Hall - 4448
CONTACT:
END:VEVENT
BEGIN:VEVENT
DTSTAMP:20240920T123220
DTSTART;TZID=America/Detroit:20240905T150000
DTEND;TZID=America/Detroit:20240905T154500
SUMMARY:Careers / Jobs:Get To Know the Disney College Program Information Session
DESCRIPTION:Come join Recruiters with Disney Programs Recruitment Team\, for a virtual engagement session where they will help you learn more about the Disney College Program and discuss the living\, learning and earning components offered. This 45-minute session aims to inform you about the Disney College Program and get you excited to learn more about this opportunity of a lifetime! 
UID:123834-21851936@events.umich.edu
URL:https://events.umich.edu/event/123834
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:
LOCATION:
CONTACT:
END:VEVENT
BEGIN:VEVENT
DTSTAMP:20240826T094639
DTSTART;TZID=America/Detroit:20240905T150000
DTEND;TZID=America/Detroit:20240905T160000
SUMMARY:Workshop / Seminar:IOE 899: Convex Mixed-Integer Optimization for Causal Discovery
DESCRIPTION:Simge Küçükyavuz is Chair and David A. and Karen Richards Sachs Professor in the Industrial Engineering and Management Sciences Department at Northwestern University. She is an expert in mixed-integer\, large-scale\, and stochastic optimization and their applications across numerous domains\, including social networks\, computing and energy infrastructure\, statistical learning\, and logistics. She is an INFORMS Fellow\, and the recipient of the NSF CAREER Award and the INFORMS Computing Society (ICS) Prize. She is the past chair of ICS and serves on the editorial boards of Mathematics of Operations Research\, Mathematical Programming\, Operations Research\, SIAM Journal on Optimization\, and MOS-SIAM Optimization Book Series. She received her Ph.D. in Industrial Engineering and Operations Research from the University of California\, Berkeley.\n\nAbstract:\nBayesian Networks (BNs) represent conditional probability relations among a set of random variables (nodes) in the form of a directed acyclic graph (DAG)\, and have found diverse applications in casual discovery. We study the problem of learning the sparse DAG structure of a BN from continuous observational data. The central problem can be modeled as a mixed-integer program with an objective function composed of a convex loss function and a regularization penalty subject to linear constraints. The optimal solution to this mathematical program is known to have desirable statistical properties under certain conditions.  However\, the state-of-the-art optimization solvers are not able to obtain provably optimal solutions to the existing mathematical formulations for medium-size problems within reasonable computational times. To address this difficulty\, we tackle the problem from both computational and statistical perspectives. On the one hand\, we propose a concrete early stopping criterion to terminate the branch-and-bound process in order to obtain a near-optimal solution to the mixed-integer program\, and establish the consistency of this approximate solution. On the other hand\, we improve the existing formulations by replacing the linear big-M constraints that represent the relationship between the continuous and binary indicator variables with second-order conic constraints.  Our numerical results demonstrate the effectiveness of the proposed approaches. This is joint work with Tong Xu\, Armeen Taeb\, Ali Shojaie.
UID:124447-21853041@events.umich.edu
URL:https://events.umich.edu/event/124447
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:899 Seminar Series,Industrial And Operations Engineering,Michigan Engineering,seminar
LOCATION:Industrial and Operations Engineering Building - 1680
CONTACT:
END:VEVENT
END:VCALENDAR