ISyE Distinguished Seminar: "Topological Design Problems and Integer Optimization"
Please join us for another special ISyE Distinguished Seminar, featuring Sven Leyffer, a deputy division director at Argonne National Laboratory. Leyffer will discuss topological design problems and integer optimization.
2:30 p.m. - Seminar
3:30 p.m. - Reception, coffee and cookies
Sven Leyffer
Deputy Division Director/Senior Computational Mathematician
Mathematics and Computer Science Division
Argonne National Laboratory
About the seminar
Topological design problems arise in many important engineering and scientific applications, such additive manufacturing and the design of cloaking devices. Leyffer and his colleagues formulate these problems as massive mixed-integer PDE-constrained optimization (MIPDECO) problems. The researchers show that despite their seemingly hopeless complexity, MIPDECOs can be solved efficiently (at a cost comparable to a single continuous PDE-constrained optimization solve). They discuss two classes of methods: rounding techniques that are shown to be asymptotically optimal, and trust-region techniques that converge under mesh refinement. The researchers illustrate these solution techniques with examples from topology optimization.
About the speaker
Sven Leyffer joined the Mathematics and Computer Science Division at Argonne in 2002, where he is now a senior computational mathematician. Leyffer is a SIAM Fellow and a senior fellow of the University of Chicago/Argonne Computation Institute. He is the current SIAM President and serves on the editorial boards of Computational Optimization and Applications, and Mathematics of Computation. In 2006, Leyffer (along with two colleagues) received the Lagrange Prize in Continuous Optimization, which is awarded only once every 3 years. In 2016, he received the Farkas Prize from the INFORMS Optimization Society. Leyffer obtained his Ph.D. in 1994 from the University of Dundee, Scotland, and held postdoctoral research positions at Dundee, Argonne, and Northwestern University. His research interests include the development of reliable methods for solving large-scale nonlinear optimization problems; implementation and analysis of filter-type algorithms; and extending nonlinear optimization methodologies to emerging areas such as mixed-integer nonlinear optimization and optimization problems with complementarity constraints.