[ugrads] Colloquium talk today at 1:50pm

Hemanshu Kaul kaul at iit.edu
Mon Feb 4 11:22:53 CST 2019


Just a quick reminder that we have a colloquium talk today on Linear
Optimization and Simplex Algorithm at 1:50pm in RE104 that should be of
interest to students who have taken Math 435 or 535 in the past, as well as
members of the Discrete math seminar. See below for the details.


Hemanshu


-------------------------
Hemanshu Kaul
Associate Professor of Applied Mathematics
Co-Director, Graduate Program on Decision Sciences (CDSOR)
Illinois Institute of Technology
http://www.math.iit.edu/~kaul/
http://iit.edu/cdsor

---------- Forwarded message ---------
From: Sonja Petrovic <sonja.petrovic at iit.edu>

Hi everyone,

I just wanted to give a heads-up for an upcoming colloquium talk that
should be of interest to you. Title and abstract appear below; please stay
tuned for the formal announcement from the department colloquium organizer.

=============
*When&where: *
Monday, February 4th, 1:50 - 2:55 PM, RE104.
Cookies and coffee/tea after the talk in RE112.

*Who: *
Jesus De Loera (UC Davis)
https://www.math.ucdavis.edu/~deloera/

*What:*
Variations on a theme by G. Dantzig: Revisiting the principles of the
Simplex Algorithm.

Linear programs (LPs) are, without any doubt, at the core of both the
theory and the practice of modern applied and computational
Optimization (e.g., in discrete optimization LPs are used in practical
computations using branch-and-bound, and in approximation algorithms,
e.g., in rounding schemes).  Fast algorithms are indispensable.

George Dantzig's Simplex method is one of the most famous algorithms to
solve
LPs and SIAM even elected it as one of the top 10 most influential
algorithms of
the 20th Century. But despite its key importance, many simple easy-to-state
mathematical
properties of the Simplex method and its geometry remain unknown. The
geometry of the simplex method is a topic in the convex-combinatorial
geometry of polyhedra.
Perhaps the most famous geometric-combinatorial challenge is to determine a
worst-case
upper bound for the graph diameter of polyhedra.

In this talk, I will look at how abstractions of simplex method provide
useful insight into the properties of this famous algorithm. The first
type of abstraction is to remove coordinates entirely and is related to
combinatorial
topology, the second is related to generalizing the pivoting moves.
This survey lecture includes joint work with Steve Klee, Raymond Hemmecke,
and Jon Lee.

-- 
Sonja Petrović

Associate Professor
Applied Mathematics
Illinois Institute of Technology
e:   Sonja.Petrovic at iit.edu
p:   312.567.3139
web:  http://math.iit.edu/~spetrov1

====
" Success is a staircase, not a doorway. Climb. "
_________________________________
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://math.iit.edu/pipermail/ugrads/attachments/20190204/3ffb4e1e/attachment.html>


More information about the ugrads mailing list