BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UM//UM*Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/New_York
TZURL:http://tzurl.org/zoneinfo/America/New_York
X-LIC-LOCATION:America/New_York
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:20191008T130737
DTSTART;TZID=America/New_York:20191031T150000
DTEND;TZID=America/New_York:20191031T170000
SUMMARY:Workshop / Seminar:Departmental Seminar (899): Santanu Dey\, Georgia Tech — *Convexification of substructures in quadratically constrained quadratic program*
DESCRIPTION:The Departmental Seminar Series is open to all. U-M Industrial and Operations Engineering graduate students and faculty are especially encouraged to attend.\n\nThe seminar will be followed by a reception in the IOE Commons (Room 1709) from 4 p.m. to 5 p.m.\n\nTitle:\nConvexification of substructures in quadratically constrained quadratic program\n\nAbstract:\nAn important approach to solving non-convex quadratically constrained quadratic program (QCQP) to global optimality is to use convex relaxations and branch-and-bound algorithms. In our first result\, we show that the exact convex hull of the solutions of a general quadratic equation intersected with any polytope is second-order cone representable. The proof is constructive and relies on the discovery of an interesting property of quadratic functions\, which may be of independent interest: A set defined by a single quadratic equation is either (1) the boundary of a convex set\, or (2) the boundary of union of two convex sets or (3) it has the property that through every point on the surface\, there exists a straight line that is entirely contained in the surface. We next study sets defined for matrix variables that satisfy rank-1 constraint together with different choices of linear side constraints. We identify different conditions on the linear side constraints\, under which the convex hull of the rank-1 set is polyhedral or second-order cone representable. Finally\, we present results from comprehensive set of computational experiments and show that our convexification results together with discretization significantly help in improving dual bounds for the generalized pooling problem. (This is joint work with Asteroide Santana and Burak Kocuk.)\n\nBio:\nSantanu S. Dey is A. Russell Chandler III Professor in the H. Milton Stewart School of Industrial and Systems Engineering at Georgia Institute of Technology. Dr. Dey's research interests are in the area of non convex optimization\, and in particular mixed integer linear and nonlinear programming. His research is partly motivated by applications of non convex optimization arising in areas such as electrical power engineering\, process engineering\, civil engineering\, logistics\, and statistics. Dr. Dey has served as the vice chair for Integer Programming for INFORMS Optimization Society (2011-2013) and has served on the program committees of Mixed Integer Programming Workshop 2013 and Integer Programming and Combinatorial Optimization 2017. He currently serves on the editorial board of Computational Optimization and Applications\, MOS-SIAM book series on Optimization\, is an area editor for Mathematical Programming C and is an associate editor for Mathematical Programming A\, Mathematics of Operations Research and SIAM Journal on Optimization.
UID:66536-16744985@events.umich.edu
URL:https://events.umich.edu/event/66536
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:899 Seminar Series,Industrial & Operations Engineering,Industrial And Operations Engineering
LOCATION:Industrial and Operations Engineering Building - 1680
CONTACT:
END:VEVENT
END:VCALENDAR