Lab Home | Phone | Search
Center for Nonlinear Studies  Center for Nonlinear Studies
 Home 
 People 
 Current 
 Affiliates 
 Alumni 
 Visitors 
 Students 
 Research 
 ICAM-LANL 
 Quantum 
 Publications 
 Publications 
 2007 
 2006 
 2005 
 2004 
 2003 
 2002 
 2001 
 2000 
 <1999 
 Conferences 
 Workshops 
 Sponsorship 
 Talks 
 Colloquia 
 Colloquia Archive 
 Seminars 
 Postdoc Seminars Archive 
 Quantum Lunch 
 CMS Colloquia 
 Q-Mat Seminars 
 Q-Mat Seminars Archive 
 Archive 
 Kac Lectures 
 Dist. Quant. Lecture 
 Ulam Scholar 
 Colloquia 
 
 Jobs 
 Students 
 Summer Research 
 Student Application 
 Visitors 
 Description 
 Past Visitors 
 Services 
 General 
 PD Travel Request 
 
 History of CNLS 
 
 Maps, Directions 
 CNLS Office 
 T-Division 
 LANL 
 
Monday, June 04, 2012
3:00 PM - 4:00 PM
CNLS Conference Room (TA-3, Bldg 1690)

Colloquium

Cutting-plane algorithms for optimization problems

Daniel Bienstock
Columbia

Cutting-plane algorithms are a theoretically valid, general methodology for optimization problems which, when properly implemented, yields numerically effective procedures. We will focus on three specific modern problems arising in diverse applications, plus broad classes on applications, and also review central theoretical ideas that have helped shape the field of optimization over the last fifty years. We will also focus on decomposition methods that decouple hard problems into easier, pinpointed subproblems that are opportunistically found; in particular, Benders' decomposition.

Host: Misha Chertkov, chertkov@lanl.gov, 665-8119