BEGIN:VCALENDAR
PRODID:-//Brown Bear Software//Calcium 4.01//EN
VERSION:2.0
METHOD:PUBLISH
BEGIN:VEVENT
SUMMARY:Circuits in Optimization
UID:x-1598-Calcium@vm-mp1-int
DTSTAMP:20200807T193552Z
DTEND:20200406T184500Z
CATEGORIES:PhD Thesis Presentation,Operations Research Seminar
ORGANIZER:MAILTO:Calcium@localhost.localdomain
DESCRIPTION:Circuits play a fundamental role in the theory of linear programming due to their intimate connection to algorithms of combinatorial optimization and the efficiency of the simplex method. Generalizing edge walks\, circuit walks follow the edge directions of the underlying polyhedron and often have useful combinatorial interpretations. Further\, circuits are used as step directions in various augmentation schemes for solving linear programs. We are interested in better understanding the properties of circuit walks in polyhedra as well as working toward viable implementations of circuit augmentation schemes.\n\nWe first introduce a hierarchy for integral polyhedra based on different types of behavior exhibited by their circuit walks. Second\, we relate circuits to a fundamental task in data analytics and machine learning: the clustering of large data sets. In particular\, we consider an application in which one clustering is gradually transformed into another via circuit walks. Third\, we address significant challenges regarding the computation of circuits via a proposed polyhedral model. This model serves as a universal framework for representing the set of circuits of any polyhedron and enables the efficient computation of so-called steepest-descent circuits. Lastly\, we work toward a viable implementation of a steepest-descent circuit augmentation scheme in which our dynamic model provides the required augmenting directions.\nSpeaker: : Charles Viss\nAffiliation: : University of Colorado Denver\nLocation: : See Zoom link from email
DTSTART:20200406T170000Z
END:VEVENT
END:VCALENDAR