SCHEDULE

See the abstracts of invited talks.

• 7:50 - 8:20: Coffee, Juice, Bagels, Fruit, and Pastries.

• First Morning Session (8:20 - 10:00)
  • 8:20 - 9:00: Dimitri Bertsekas, Massachusetts Institute of Technology
                       " Extended Monotropic Programming and Polyhedral Approximations "

  • 9:00 - 9:30: Jonathan Eckstein, Rutgers
                       " A Practical Relative Error Criterion for the Classic Augmented Lagrangian "

  • 9:30 - 10:00: Warren Hare, The University of British Columbia, Okanagan
                       " Identifying Active Manifolds in Regularization Problems "

• 10:00 - 10:20: Coffee Break

• Second Morning Session (10:20 - 12:00)
  • 10:20 - 11:00: Michael Friedlander, University of British Columbia
                       " Exact Regularization of Convex Programs "

  • 11:00 - 11:30: Jiawang Nie, University of California, San Diego
                       " Discriminants and Nonnegative Polynomials "

  • 11:30 - 12:00: Jiming Peng, University of Illinois, Urbana-Champaign
                       " Finding the Densest k-Subgraph via Clustering and Spectral Methods "

• 12:00 - 1:20: Lunch

• Afternoon Session (1:20 - 3:00)
  • 1:20 - 2:00: Samuel Burer, The University of Iowa
                       " Nonconvex Quadratic Programming: Models and Algorithms "

  • 2:00 - 2:30: Yinyu Ye, Stanford University
                       " Rigidity and Localization: An Optimization Perspective "

  • 2:30 - 3:00: Ting Kei Pong, Unversity of Washington
                       " ESDP Relaxation of Sensor Network Localization: Analysis, Extensions and Algorithms "