13-15 September 2010
University of Birmingham

Invited Speakers

Invited speakers include:

Nonlinear Programming Strategies for Distillation Optimization - Larry Biegler (Carnegie Mellon University)
Nick Higham (University of Manchester)
Adrian Lewis (Cornell University)
Volker Mehrmann (Technische Universität Berlin)
Mike Saunders (Stanford University)
Valeria Simoncini (Università di Bologna)
Jared Tanner (University of Edinburgh)
Iterative linear solvers for PDE-constrained Optimization problems involving fluid flow - Andy Wathen (University of Oxford)

Talks will take place in the School of Mathematics.


Abstracts

Nonlinear Programming Strategies for Distillation Optimization
L.T. Biegler ( Chemical Engineering Department, Carnegie Mellon University, Pittsburgh)

Abstract: Distillation remains one of the most widely used methods for separation of chemical components; it has been estimated that distillation processes alone requires about a quarter of the energy consumed by the US manufacturing sector. Hence, it is not surprising that distillation optimization represents an important activity in process engineering. On the other hand, their optimization models also present a number of challenges for numerical solution.  This talk explores the distillation application from the perspective of a rich source of features relevant to current topics in nonlinear programming.  First, optimization models for distillation form scalable NLPs in a number of ways, through the number of stages or trays (blocks), the number of chemical species (size of blocks), phase and chemical equilibrium (degree of nonlinearity/rank deficiency)). Moreover, there are interesting ways to combine distillation sections, so the problem structure evolves from block tridiagonal to a blocked structure with arbitrary off-diagonal interconnections. Second, the need to model disappearing phases on distillation trays leads to interesting MPEC formulations.  Finally, when dynamic behavior of distillation models is considered, quite innocent optimization formulations can lead to high index formulations and singular control.  The development of efficient, large-scale NLP algorithms allows the formulation of optimization models that begin to tackle these challenges with fast and reliable solution strategies. These will be demonstrated on distillation models that incorporate all of the features discussed above.

Biography: Lorenz T. (Larry) Biegler is currently the Bayer Professor of Chemical Engineering at Carnegie Mellon University, which he joined after receiving his PhD from the University of Wisconsin in 1981. His research interests lie in computer aided process engineering and include flowsheet optimization, optimization of systems of differential and algebraic equations, and optimization algorithms for nonlinear estimation and control.  Prof. Biegler has held visiting positions at Argonne National Laboratory, Sandia National Laboratory, Zhejiang University, the University of Dortmund, the University of Heidelberg, and the University of Wisconsin.  He has authored or co-authored over 250 archival publications, and, with Ignacio Grossmann and Art Westerberg, coauthored the textbook "Systematic Methods of Chemical Process Design".

Back to Top

 

Iterative linear solvers for PDE-constrained Optimization problems involving fluid flow
Andy Wathen (University of Oxford)

Abstract: The numerical approximation of Partial Differential Equation (PDE) problems leads typically to large dimensional linear or linearised systems of equations. For problems where such PDEs provide only a constraint on an Optimization problem (so-called PDE-constrained Optimization problems), the systems are many times larger in dimension.

We will discuss the solution of such problems by preconditioned iterative techniques in particular where the PDEs in question are the Stokes and Navier-Stokes equations describing incompressible fluid flow.

Biography: Andy Wathen is Reader in Numerical Analysis at Oxford University, UK and Tutor in Applied Mathematics at New College. His batchelors degree in Mathematics from Oxford in 1980 was followed by a PhD from Reading University in 1984. After a short period in the Computer Science Department at Stanford University and as a postdoc in Reading he became a lecturer at Bristol University in 1986 and subsequently moved to Oxford in 1996. His research interests lie at the interface of Numerical Linear Algebra and discretization methods for partial differential equations, in particular the Finite Element Method as exemplified by his book `Finite Elements and Fast Iterative Solvers' written jointly with Howard Elman and David Silvester. For the past several years his research has focused on preconditioning for iterative solution methods in the context of large scale Scientific Computing involving PDEs. A particular interest has been in saddle-point systems because of their wide applicability.

Back to Top