Network Optimization

Hedco Auditorium (SGM 123)
Lecture: 4:30 to 5:30 PM
Reception: 5:30 to 6:30 PM

Resource allocation problems in many different types of networks can often be posed as convex optimization problems, and duality theory can then be used to derive optimal algorithms. The talk will illustrate the applications of this rich theory at the intersection of optimization, stochastic networks, combinatorial optimization and stochastic approximation. Specifically, we will present applications of this paradigm to problems ranging from wireless networks to online advertising with budget constraints.

R. Srikant received his B.Tech. from the Indian Institute of Technology, Madras in 1985, his M.S. and Ph.D. from the University of Illinois at Urbana-Champaign in 1988 and 1991, respectively, all in Electrical Engineering. He was a Member of Technical Staff at AT&T Bell Laboratories from 1991 to 1995. He is currently at the University of Illinois at Urbana-Champaign, where he is the Fredric G. and Elizabeth H. Nearing Endowed Professor of Electrical and Computer Engineering and a Research Professor in the Coordinated Science Lab. His research interests include communication networks, stochastic processes, and game theory.

Published on September 27th, 2016

Last updated on August 2nd, 2023