Interior-point decomposition approaches for parallel solution of large-scale nonlinear parameter estimation problems

被引:89
作者
Zavala, Victor A. [1 ]
Laird, Carl D. [1 ]
Biegler, Lorenz T. [1 ]
机构
[1] Carnegie Mellon Univ, Dept Chem Engn, Pittsburgh, PA 15213 USA
关键词
Parameter estimation; Nonlinear programming; Dynamic optimization; Collocation;
D O I
10.1016/j.ces.2007.05.022
中图分类号
TQ [化学工业];
学科分类号
0817 ;
摘要
Multi-scenario optimization is a convenient way to formulate and solve multi-set parameter estimation problems that arise from errorsin-variables-measured (EVM) formulations. These large-scale problems lead to nonlinear programs (NLPs) with specialized structure that can be exploited by the NLP solver in order to obtained more efficient solutions. Here we adapt the IPOPT barrier nonlinear programming algorithm to provide efficient parallel solution of multi-scenario problems. The recently developed object oriented framework, IPOPT 3.2, has been specifically designed to allow specialized linear algebra in order to exploit problem specific structure. This study discusses high-level design principles of IPOPT 3.2 and develops a parallel Schur complement decomposition approach for large-scale multi-scenario optimization problems. A large-scale case study example for the identification of an industrial low-density polyethylene (LDPE) reactor model is presented. The effectiveness of the approach is demonstrated through the solution of parameter estimation problems with over 4100 ordinary differential equations, 16,000 algebraic equations and 2100 degrees of freedom in a distributed cluster. (c) 2007 Elsevier Ltd. All rights reserved.
引用
收藏
页码:4834 / 4845
页数:12
相关论文
共 32 条
[1]   A NEW BASIS IMPLEMENTATION FOR A MIXED ORDER BOUNDARY-VALUE ODE SOLVER [J].
BADER, G ;
ASCHER, U .
SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1987, 8 (04) :483-500
[2]  
BARTLETT RA, 2002, RSQP OBJECT ORIENTED
[3]  
BARTLETT RA, 2001, THESIS CARNEGIE MELL
[4]  
BARTLETT RA, 2002, NEW LINEAR ALGEBRA I
[5]   Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions [J].
Benson, HY ;
Vanderbei, RJ ;
Shanno, DF .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2002, 23 (02) :257-272
[6]   Large scale parameter estimation using sparse nonlinear programming methods [J].
Betts, JT ;
Huffman, WP .
SIAM JOURNAL ON OPTIMIZATION, 2003, 14 (01) :223-244
[7]   Multiperiod design and planning with interior point methods [J].
Bhatia, TK ;
Biegler, LT .
COMPUTERS & CHEMICAL ENGINEERING, 1999, 23 (07) :919-932
[8]   Retrospective on optimization [J].
Biegler, LT ;
Grossmann, IE .
COMPUTERS & CHEMICAL ENGINEERING, 2004, 28 (08) :1169-1192
[9]   Advances in simultaneous strategies for dynamic process optimization [J].
Biegler, LT ;
Cervantes, AM ;
Wächter, A .
CHEMICAL ENGINEERING SCIENCE, 2002, 57 (04) :575-593
[10]   Parallel Lagrange-Newton-Krylov-Schur methods for PDE-constrained optimization. Part I: The Krylov-Schur solver [J].
Biros, G ;
Ghattas, O .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2005, 27 (02) :687-713