Optbridge 2006 

           

 


Aims                           Building and strengthening links between Oxbridge continuous optimization communities. Identify 

                                    common research interests and opportunities for future interactions 

 

 

Format                       This is a small one-day workshop to exchange ideas. The duration of each presentation is flexible but 

                                    should not exceed 40 minutes. The room will be fitted with a whiteboard, a data projector and a networked PC in case 

                                    you would like to use one. File formats pdf, ps, ppt should be ok. 

 

                                    We will have lunch at the Living Room (to be paid individually) and coffee breaks at the business school.  

 

 

History                       Optbridge is a yearly event and alternates between Oxford and Cambridge. Optbridge 2004 was the 

                                    first one of the series.

 

 

 

When and where?      Wednesday 23rd of August of 2006

                                     Lecture Theatre 4, Said Business School.

 

 

 

Directions                   Follow this link for directions to the business school. Once at the school, please report to the reception 

                                     and let them know that you are here for the workshop. If you need a parking place please drop me an email.

 

 

Contacts                     If you have any query, please contact Nick Gould, Raphael Hauser, or Dolores Romero Morales                   

 

 

 

Schedule                     This is a very tentative schedule for the day

                                     9:30 --10:00   Coffee in Seminar Room 17


                                     10:00 --12:30  Danny Ralph: Intro to Large Deviations and why this describe convergence in stochastic optimization
                                                            Mike Powell: An extension of the NEWUOA software for minimization without derivatives that allows 

                                                            bounds on the variables
                                                            Coralia Cartis: A new perspective on the complexity of interior point methods for linear programming

                                                            Nick Gould: Successive and simultaneous projection methods for convex feasibility problems  

                                     12:30 --14:00 Lunch and group discussion at the Living Room

                                     14:00 --16:00 Richard Steinberg: Congestion Pricing and Non-Cooperative Games in Communication Networks

                                                            Gilbert Strang (Balliol College): Maximum Flow in a Domain and Large Quadratic Programs
                                                            Dolores Romero Morales:  Decentralized Two-Level Lot-Sizing Models
                                                            Raphael Hauser: A New Proof of Yakubovich's s-Lemma

                                    16:00 --16:30   Tea in Seminar Room 17

                                    16:30 -- ??        Pint at the pub for those who have time 

 

 

 

 

 

This page was last updated 17/08/2006 12:33

go to main page