umn logo IMA home |  Contact IMA 
IMA Web
Hot Topics Workshops and Special Events

IMA Hot Topics Workshop:

Mixed-Integer Nonlinear Optimization: Algorithmic Advances and Applications

November 17-21, 2008
Sponsor
   
IBM logo

With generous support from IBM Research.

Organizers:
Jon Lee T.J. Watson Research Center, IBM Corporation
Sven Leyffer Mathematics and Computer Science, Argonne National Laboratory

Schedule Participants Program Application Feedback
IMA Live Streaming and Webcasting Photo Gallery Maps
Abstracts and Talk Materials Dining Guide

Description:

Many engineering, operations, and scientific applications involve both discrete decisions and nonlinear relationships that significantly affect the feasibility and optimality of solutions. Mixed-integer nonlinear programming (MINLP) problems combine the difficulty of optimizing over discrete variable sets with the challenges of handling nonlinear functions. MINLP is one of the most flexible modeling paradigms available: An expanding body of researchers and practitioners, including chemical engineers, operations researchers, industrial engineers, mechanical engineers, economists, statisticians, computer scientists, operations managers, and mathematical programmers are interested in solving large-scale MINLPs.

Unfortunately, the wealth of applications that can be accurately modeled by using MINLP is not yet matched by the capability of available optimization solvers. Yet, the two components of MINLP, namely mixed-integer linear programming (MIP), and nonlinear programming (NLP), have witnessed tremendous progress over the past 15 years. By cleverly incorporating many theoretical advances in MIP research, powerful academic, open source, and commercial solvers paved the way for MIP to emerge as a viable, widely used decision-making tool. Similarly, new paradigms and a better theoretical understanding have created faster and more reliable NLP solvers that work well even under adverse conditions such as failures of constraint qualifications.

The time is right to synthesize these advances and inspire new ideas in order to transform MINLP into an area in which researchers and practitioners can access robust tools and methods capable of solving a wide range of important, commonly occurring decision support problems. This workshop brings together experts from relevant optimization areas to exchange recent results on MINLP, chart the future of MINLP, explore new and innovative applications, and outline the challenges facing this area. The workshop will discuss novel solution approaches and the impact of new powerful computational resources to solve MINLP problems.

Schedule
Monday | Tuesday | Wednesday | Thursday | Friday
  Monday, November 17
8:00am-8:45am Registration and coffee   EE/CS 3-176
8:45am-9:00am Welcome to the IMA Fadil Santosa (University of Minnesota) EE/CS 3-180
9:00am-10:00am Building an effective solver for convex mixed integer nonlinear programs Jeff Linderoth (University of Wisconsin) EE/CS 3-180
10:00am-10:30am Coffee   EE/CS 3-176
10:30am-11:15am Branching strategies and heurisitcs in a branch-and-bound for convex MINLPs Pierre Bonami (Centre National de la Recherche Scientifique (CNRS)) EE/CS 3-180
11:15am-12:00pm Branching rules in branch-and-bound algorithms for nonconvex mixed-integer nonlinear programming Pietro Belotti (Lehigh University) EE/CS 3-180
12:00pm-2:00pm Lunch    
2:00pm-2:45pm Fast infeasibility detection in nonlinear optimization Jorge Nocedal (Northwestern University) EE/CS 3-180
2:45pm-3:30pm Using interior-point methods within MINLP Hande Yurttan Benson (Drexel University) EE/CS 3-180
3:30pm-3:45pm Group Photo    
3:45pm-4:15pm Coffee   EE/CS 3-176
4:15pm-5:15pm Discussion Sven Leyffer (Argonne National Laboratory) EE/CS 3-180
  Tuesday, November 18
8:30am-9:00am Coffee   EE/CS 3-176
9:00am-10:00am Copositive programming and combinatorial optimization Franz F. Rendl (Universität Klagenfurt) EE/CS 3-180
10:00am-10:30am Coffee   EE/CS 3-176
10:30am-11:15am The difference between 5x5 doubly nonnegative and completely positive matrices Kurt M. Anstreicher (University of Iowa) EE/CS 3-180
11:15am-12:00pm Convex relaxations of non-convex MIQCP Anureet Saxena (Axioma Inc.) EE/CS 3-180
12:00pm-2:00pm Lunch    
2:00pm-2:45pm A branch-and-refine method for nonconvex mixed integer optimization Annick Sartenaer (Facultés Universitaires Notre Dame de la Paix (Namur)) EE/CS 3-180
2:45pm-3:30pm Reformulations in mathematical programming: Symmetry Leo Liberti (École Polytechnique) EE/CS 3-180
3:30pm-4:00pm Coffee   EE/CS 3-176
4:00pm-5:00pm Discussion Francois Margot (Carnegie Mellon University) EE/CS 3-180
5:00pm-6:30pm Poster Session and Reception: 5:00-6:30
Poster submissions welcome from all participants
Lind Hall 400
Computer algebra, combinatorics, and complexity: Hilbert's Nullstellensatz and NP-complete problems ()
On non-convex quadratic programming with box constraints Samuel Burer (University of Iowa)
Water network design by MINLP Claudia D'Ambrosio (Università di Bologna)
Experimental investigations in non-linear matroid optimization David Haws (University of California, Davis)
Graph realizations corresponding to optimized extremal eigenvalues of the Laplacian Christoph Helmberg (Technische Universität Chemnitz-Zwickau)
HIPO: A non-linear mixed integer constrained optimization algorithm for treatment planning in brachytherapy Andreas G. Karabis (PI Medical Ltd)
Utilizing strong branching information in convex mixed integer nonlinear programs Mustafa Rasim Kilinc (University of Wisconsin)
MISQP: Mixed-integer sequential quadratic programming Thomas Lehmann (Universität Bayreuth)
Triangles, envelopes, and nonconvex quadratic programming Jeff Linderoth (University of Wisconsin)
An algorithm for solving nonlinear optimization problems with linear constraints and binary variables Kien Ming Ng (National University of Singapore)
Linear programs with complementarity constraints: Algorithms and applications John E. Mitchell (Rensselaer Polytechnic Institute)
Towards a parallel macro partitioning (PMaP) framework for MINLP problems Mahdi Namazifar (University of Wisconsin)
Variable neighbourhood search for MINLPs Giacomo Nannicini (École Polytechnique)
Physarum can solve the shortest path decision problem mathematically rigorously Isamu Onishi (Hiroshima University)
Real-time optimization, control and optimal allocation Jaroslav Pekar (Honeywell)
New convex relaxations for quadratic assignment problems Jiming Peng (University of Illinois at Urbana-Champaign)
Direct numerical methods for mixed-integer optimal control problems Sebastian Sager (Ruprecht-Karls-Universität Heidelberg)
Convex relaxations of non-convex MIQCP Anureet Saxena (Axioma Inc.)
Some challenging mixed integer nonlinear optimization problems Tamás Terlaky (Lehigh University)
Exact and heuristic algorithms for the Euclidean Steiner tree problem Jon Van Laarhoven (University of Iowa)
Exact algorithms for the quadratic linear ordering problem Angelika Wiegele (Universität Klagenfurt)
  Wednesday, November 19
8:30am-9:00am Coffee   EE/CS 3-176
9:00am-10:00am What's new in SQP methods? Philip E. Gill (University of California, San Diego) EE/CS 3-180
10:00am-10:30am Coffee   EE/CS 3-176
10:30am-11:15am Global optimization of MINLP problems containing signomial functions Tapio Westerlund (Åbo Akademi (Finland-Swedish University of Åbo)) EE/CS 3-180
11:15am-12:00pm A local relaxation approach for the siting of electrical substations Uday V. Shanbhag (University of Illinois at Urbana-Champaign) EE/CS 3-180
12:00pm-2:00pm Lunch    
2:00pm-2:45pm A comparative study of linear and semidefinite branch-and-cut methods for solving the minimum graph bisection problem Christoph Helmberg (Technische Universität Chemnitz-Zwickau) EE/CS 3-180
2:45pm-3:10pm Preprocessing techniques for discrete optimization problems Todd S. Munson (Argonne National Laboratory) EE/CS 3-180
3:10pm-3:35pm Using expression graphs in optimization algorithms David M. Gay (Sandia National Laboratories) EE/CS 3-180
3:35pm-4:05pm Coffee   EE/CS 3-176
4:05pm-5:05pm Discussion Tamás Terlaky (Lehigh University) EE/CS 3-180
  Thursday, November 20
8:30am-9:00am Coffee   EE/CS 3-176
9:00am-10:00am Nonlinear discrete optimization I Robert Weismantel (Otto-von-Guericke-Universität Magdeburg) EE/CS 3-180
10:00am-10:30am Coffee   EE/CS 3-176
10:30am-11:15am Nonlinear discrete optimization II Shmuel Onn (Technion-Israel Institute of Technology) EE/CS 3-180
11:15am-12:00pm On the foundations of the theory of non-Linear and multi-objective integer optimization Jesus Antonio De Loera (University of California, Davis) EE/CS 3-180
12:00pm-2:00pm Lunch    
2:00pm-2:25pm Parallelization issues for MINLP Part I William E. Hart (Sandia National Laboratories) EE/CS 3-180
2:25pm-2:50pm Parallelization issues for MINLP Part II Cynthia A. Phillips (Sandia National Laboratories) EE/CS 3-180
2:50pm-3:35pm MINLP application for optimizing sourcing decisions in a distressed supplier environment Erica Zimmer Klampfl (Ford) EE/CS 3-180
3:35pm-4:05pm Coffee   EE/CS 3-176
4:05pm-5:05pm Discussion Jon Lee (IBM) EE/CS 3-180
6:30pm-8:30pm Workshop dinner at Pagoda Restaurant   Pagoda Restaurant
1417 4th St. SE
Minneapolis, MN
612-378-4710 
  Friday, November 21
8:30am-9:00am Coffee   EE/CS 3-176
9:00am-10:00am Generalized disjunctive programming: A framework for formulation and alternative algorithms for MINLP optimization Ignacio E. Grossmann (Carnegie Mellon University) EE/CS 3-180
10:00am-10:30am Coffee   EE/CS 3-176
10:30am-11:15am Mixed integer second order cone programming Sarah Drewes (TU Darmstadt) EE/CS 3-180
11:15am-12:00pm Solving nonconvex MINLP by quadratic approximation Stefan Vigerske (Humboldt-Universität) EE/CS 3-180
12:00pm-2:00pm Lunch    
2:00pm-2:45pm Nonlinear optimization via summation and integration Matthias Koeppe (University of California, Davis) EE/CS 3-180
2:45pm-3:30pm From the stable set problem to convex algebraic geometry Pablo A. Parrilo (Massachusetts Institute of Technology) EE/CS 3-180
3:30pm-4:00pm Coffee   EE/CS 3-176
4:00pm-5:00pm Discussion Tapio Westerlund (Åbo Akademi (Finland-Swedish University of Åbo)) EE/CS 3-180
5:00pm-5:05pm Closing remark Jon Lee (IBM), Sven Leyffer (Argonne National Laboratory) EE/CS 3-180

LIST OF CONFIRMED PARTICIPANTS

NameDepartmentAffiliation
Kurt M. AnstreicherDepartment of Management Sciences University of Iowa
Pietro BelottiIndustrial and Systems Engineering Department Lehigh University
Hande Yurttan BensonDepartment of Decision Sciences Drexel University
Dimitris BertsimasSloan School of Management Massachusetts Institute of Technology
Lorenz T. BieglerChemical Engineering Department Carnegie Mellon University
Christian BliekCPLEX R&D ILOG Corporation
Pierre BonamiLaboratoire d'Informatique Fondamentale de Marseille Centre National de la Recherche Scientifique (CNRS)
Samuel BurerDepartment of Management Sciences University of Iowa
Alfonso Cano University of Minnesota
Xianjin ChenInstitute for Mathematics and its Applications University of Minnesota
Claudia D'AmbrosioDipartimento di Elettronica, Informatica e Sistemistica Università di Bologna
Michel Jacques DaydéENSEEIHT Institut National Polytechnique de Toulouse
Jesus Antonio De LoeraDepartment of Mathematics University of California, Davis
Sarah DrewesMathematics, Research Group Nonlinear Optimization TU Darmstadt
Ricardo FukasawaT.J. Watson Research Center IBM
Kevin Furman Exxon Research and Engineering Company
Weiguo GaoSchool of Mathematical Sciences Fudan University
David M. GayOptimization and Uncertainty Estimation Sandia National Laboratories
Philip E. GillDepartment of Mathematics University of California, San Diego
Ignacio E. GrossmannDepartment of Chemicial Engineering Carnegie Mellon University
Oktay GunlukMathematical Sciences Department IBM
William E. Hart Sandia National Laboratories
David HawsDepartment of Mathematics University of California, Davis
Christoph HelmbergFakultät für Mathematik Technische Universität Chemnitz-Zwickau
Andreas G. KarabisDepartment of Research and Development PI Medical Ltd
Vassilio kekatos University of Minnesota
Mustafa Rasim KilincIndustrial and Systems Engineering Department University of Wisconsin
Erica Zimmer KlampflFord Research Laboratory Ford
Matthias KoeppeDepartment of Mathematics University of California, Davis
Jon LeeMathematical Sciences Department IBM
Thomas LehmannFachgruppe Informatik Universität Bayreuth
Sven LeyfferMathematics and Computer Science Division Argonne National Laboratory
Tong LiDepartment of Mathematics University of Iowa
Yongfeng LiInstitute for Mathematics and its Applications University of Minnesota
Leo LibertiLIX École Polytechnique
Jeff LinderothDepartment of Industrial and Systems Engineering University of Wisconsin
Chun LiuInstitute for Mathematics and its Applications University of Minnesota
Andrea Lodi Università di Bologna
James LuedtkeIndustrial and Systems Engineering Department University of Wisconsin
Tom LuoDepartment of Electrical and Computer Engineering University of Minnesota
Francois MargotSchool of Business Carnegie Mellon University
Susan MarguliesDepartment of Computational and Applied Mathematics Rice University
Andrew James MillerDepartment of Mathematics Université de Bordeaux I
Kien Ming NgDepartment of Industrial & Systems Engineering National University of Singapore
John E. MitchellDepartment of Mathematical Sciences Rensselaer Polytechnic Institute
Hans MittelmannDepartment of Mathematics and Statistics Arizona State University
Todd S. MunsonMathematics and Computer Science Division Argonne National Laboratory
Mahdi NamazifarIndustrial and Systems Engineering Department University of Wisconsin
Giacomo NanniciniLaboratoire d'Informatique École Polytechnique
Jorge NocedalDepartment of Electrical Engineering and Computer Science Northwestern University
Isamu OnishiDepartment of Mathematical and Life Sciences Hiroshima University
Shmuel OnnIE & M Technion-Israel Institute of Technology
Pablo A. ParriloElectrical Engineering and Computer Science Department Massachusetts Institute of Technology
Jaroslav PekarHoneywell Prague Laboratory Honeywell
Jiming PengDepartment of Industrial and Enterprise System Engineering University of Illinois at Urbana-Champaign
Cynthia A. PhillipsDiscrete Mathematics and Complex Systems Department Sandia National Laboratories
Kashif RashidMathematical Modelling Department Schlumberger Cambridge Research
Franz F. RendlInstitut für Mathematik Universität Klagenfurt
Kees RoosDepartment of Statistics, Probability and Oper Research Technische Universiteit te Delft
Sebastian SagerInterdisciplinary Center for Scientific Computing Ruprecht-Karls-Universität Heidelberg
Fadil SantosaInstitute for Mathematics and its Applications University of Minnesota
Annick SartenaerDepartment of Mathematics Facultés Universitaires Notre Dame de la Paix (Namur)
Anureet Saxena Axioma Inc.
Uday V. ShanbhagIndustrial & Enterprise Systems Engineering Department University of Illinois at Urbana-Champaign
Tamás TerlakyDepartment of Industrial and Systems Engineering Lehigh University
Jon Van LaarhovenDepartment of Applied Mathematics and Computational Sciences University of Iowa
Stefan VigerskeDepartment of Mathematics Humboldt-Universität
Andreas WächterMathematical Sciences Department IBM
Richard A. WaltzDepartment of Industrial and Systems Engineering University of Southern California
Robert WeismantelDepartment of Mathematical Optimization Otto-von-Guericke-Universität Magdeburg
Tapio WesterlundDepartment of Chemical Engineering Åbo Akademi (Finland-Swedish University of Åbo)
Angelika WiegeleDepartment of Mathematics Universität Klagenfurt
Fei YangDepartment of Biomedical Engineering University of Minnesota
Hongchao ZhangDepartment of Mathematics Louisiana State University