Date: Thursday, April 11, 2013
Location: Nesbitt Room (4:00 PM to 5:00 PM)
Title: Convexity
Abstract: A convex set is a set which contains all line segments connecting any two of its points. This notion of convexity is surprisingly important and it appears in a wide variety of pure and applied topics, especially optimization. I will give examples of convex sets, convex functions and convex functionals and will show how many problems, when viewed in the right set of variables, become convex optimization problems that are easy to solve.
Speaker: Hala Shehadeh
Institution: Univ. of Michigan
Event Organizer:
|
