2015
DOI: 10.1021/acs.iecr.5b02369
|View full text |Cite
|
Sign up to set email alerts
|

An Analytical Hessian and Parallel-Computing Approach for Efficient Dynamic Optimization Based on Control-Variable Correlation Analysis

Abstract: The approach of combined multiple-shooting with collocation is efficient for solving large-scale dynamic optimization problems. The aim of this work was to further improve its computational performance by providing an analytical Hessian and realizing a parallel-computing scheme. First, we derived the formulas for computing the second-order sensitivities for the combined approach. Second, a correlation analysis of control variables was introduced to determine the necessity of employing the analytical Hessian to… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
19
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 17 publications
(20 citation statements)
references
References 48 publications
1
19
0
Order By: Relevance
“…1 summarizes the results obtained by AGPM and other methods and results given in the literature. The reported best result is 21.82414 obtained by the method combining multiple‐shooting with collocation (MSC) in 41. It is obvious that the performance index 21.8256 achieved by the proposed AGPM approach is slightly better, reflecting the effectiveness of the proposed method.…”
Section: Case Studiesmentioning
confidence: 98%
“…1 summarizes the results obtained by AGPM and other methods and results given in the literature. The reported best result is 21.82414 obtained by the method combining multiple‐shooting with collocation (MSC) in 41. It is obvious that the performance index 21.8256 achieved by the proposed AGPM approach is slightly better, reflecting the effectiveness of the proposed method.…”
Section: Case Studiesmentioning
confidence: 98%
“…This problem is the closest thing to a standard problem of dynamic optimization in the Modelica community, having been used several times for benchmark purposes [5,6,40,51,59]. …”
Section: Ccppmentioning
confidence: 99%
“…The considered scenario is a short reflux breakdown during steady state, with the objective to steer back to the desired steady state, using quadratic costs on the deviation of two tray temperatures and input signals from the high-purity steady state. The Modelica implementation of this scenario and model has been previously used for benchmarking dynamic optimization algorithms [40,45]. However, the model was then incorrectly implemented, leading to 125 differential variables, instead of the correct 40.…”
Section: Distillation Columnmentioning
confidence: 99%
“…It is well‐known that the Broyden‐Fletcher‐Goldfarb‐Shanno (BFGS) method is an effective approximation with its low computational cost for solving NLP problems . The BFGS method uses an approximate Hessian instead of a real Hessian, which reduces the computational complexity of the algorithm . However, the accuracy of the solution with a real Hessian is higher than that of applying the BFGS method, and thus providing an analytical second order sensitivity information for the solver is beneficial for the solution of the problems with a high accuracy requirement .…”
Section: Introductionmentioning
confidence: 99%
“…[31] The BFGS method uses an approximate Hessian instead of a real Hessian, which reduces the computational complexity of the algorithm. [32,33] However, the accuracy of the solution with a real Hessian is higher than that of applying the BFGS method, and thus providing an analytical second order sensitivity information for the solver is beneficial for the solution of the problems with a high accuracy requirement. [34] Moreover, the introduction of analytical second-order sensitivities can also improve the efficiency of the method for some cases.…”
Section: Introductionmentioning
confidence: 99%