.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Multiperiod dynamic optimization
Multiple-shooting
Sequential quadratic programming
Interior-point methods
Parallel computing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.9
论文数:
8.1K
被引数:
1.7W
机构
引用论文
Genetic transfer of a functional human interferon α receptor into mouse cells: Cloning and expression of its c-DNA.png)
Cell
CellIF0
PREAI
分享收藏
Solving non-linear portfolio optimization problems with the primal-dual interior point method用原-对偶内点法求解非线性投资组合优化问题
PREAI
分享收藏
查看更多内容