.png){kind=icon}
Return
A parallel structure exploiting nonlinear programming algorithm for multiperiod dynamic optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compchemeng.2017.03.021.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article develops a sequential quadratic programming (SQP) algorithm that utilizes a parallel interior point method (IPM) for the QP subproblems. Our approach is able to efficiently decompose and solve large-scale multiperiod nonlinear programming (NLP) formulations with embedded dynamic model representations, through the use of an explicit Schur-complement decomposition within the IPM. The algorithm implementation makes use of a computing environment that uses the parallel distributed computing message passing interface (MPI) and specialized vector-matrix class representations, as implemented in the third-party software package, OOPS. The proposed approach is assessed, with a focus on computational speedup, using several benchmark examples involving applications of parameter estimation and design under uncertainty which utilize static and dynamic models. Results indicate significant improvements in the NLP solution speedup when moving from a serial full-space direct factorization approach, to a serial Schur-complement decomposition, to a parallelized Schur-complement decomposition for the primal-dual linear system solution within the IPM. (C) 2017 Elsevier Ltd. All rights reserved.
Keywords:
Multiperiod dynamic optimization
Multiple-shooting
Sequential quadratic programming
Interior-point methods
Parallel computing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
3.9
Papers:
8.1K
Citations:
1.7W
Organization
Cited Papers
ShareSaveShareSaveGenetic transfer of a functional human interferon α receptor into mouse cells: Cloning and expression of its c-DNA.png)
Cell
CellIF0
PREAI
ShareSave
ShareSave
ShareSaveShareSaveShareSave
View more