2005
DOI: 10.1016/j.compchemeng.2005.02.036
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic optimization using adaptive control vector parameterization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
137
0
1

Year Published

2007
2007
2019
2019

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 195 publications
(138 citation statements)
references
References 19 publications
0
137
0
1
Order By: Relevance
“…where r o is the oil revenue [ Several methods are available for dynamic optimization of large scale problems, see Bryson (1999), Schlegel et al (2005) and Biegler (2007). Simultaneous methods have attractive convergence and constraint handling properties, but even though their capacity to cope with large-scale problems has increased considerably over the recent years, models of order 10…”
Section: Waterflooding Optimization Problemmentioning
confidence: 99%
“…where r o is the oil revenue [ Several methods are available for dynamic optimization of large scale problems, see Bryson (1999), Schlegel et al (2005) and Biegler (2007). Simultaneous methods have attractive convergence and constraint handling properties, but even though their capacity to cope with large-scale problems has increased considerably over the recent years, models of order 10…”
Section: Waterflooding Optimization Problemmentioning
confidence: 99%
“…This approximation relies on a parameterization of the control trajectories, and therefore direct methods are less rigorous than indirect methods in this regard. In practice, however, the resulting performance loss is hardly noticeable when a tailored parameterization is used or by applying an adaptive parameterization approach [45]. Besides, singular control problems as well as path-constrained problems can be handled more conveniently by direct methods.…”
Section: Direct Two-layer Schemementioning
confidence: 99%
“…The discrete-time finite-dimensional optimal control problem may be solved using single-shooting (control vector parametrization) [10], multiple shooting [11], [12], or the simultaneous method [13]. In these methods, a sequential quadratic programming (SQP) algorithm is typically used for the optimization.…”
Section: B Single-shooting Optimizationmentioning
confidence: 99%