1999
DOI: 10.1016/s0098-1354(98)00292-0
|View full text |Cite
|
Sign up to set email alerts
|

Interior point SQP strategies for large-scale, structured process optimization problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
18
0

Year Published

1999
1999
2015
2015

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 35 publications
(18 citation statements)
references
References 10 publications
0
18
0
Order By: Relevance
“…Previous work that addresses efficient solution of the QPs that arise in MPC includes [27]- [29], and [63]; for efficient methods for large-scale MPC problems arising in chemical process control, see [30]- [32]. Efficient methods for robust MPC are addressed by [33]- [35].…”
Section: A Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Previous work that addresses efficient solution of the QPs that arise in MPC includes [27]- [29], and [63]; for efficient methods for large-scale MPC problems arising in chemical process control, see [30]- [32]. Efficient methods for robust MPC are addressed by [33]- [35].…”
Section: A Related Workmentioning
confidence: 99%
“…It can be factored efficiently using a specialized method described below for block tridiagonal matrices (which is related to the Riccati recursion in control theory) [27]- [29], [55], [56], or by treating it as a banded matrix, with bandwidth . Both of these methods require order flops ( [3], [4], [29]- [32], [55], [56] flops. The cost of step 3 is dominated by the other steps, since the Cholesky factorization of was already computed in step 1.…”
Section: Fast Computation Of the Newton Stepmentioning
confidence: 99%
“…Of course, many other nonlinear optimization techniques have been proposed in the literature to handle nonlinear MPC and some of these could also potentially mitigate/eliminate the convergence problems (e.g., sequential quadratic (SQP) approaches using PD IPM to solve the subproblems [40], feasibility-perturbed SQP programming [41], active set quadratic programming [42], reduced space interior point strategy [43]). …”
Section: F Other Mpc Solversmentioning
confidence: 99%
“…z,ż,z, · · · , z (r) are the flat output and its derivatives, and the order of derivative r corresponds to the controllability index satisfying Equation (5). In this formulation, the model reduces to a trivial dynamics Equation (5).…”
Section: Nonlinear Mpc For Flat Systemsmentioning
confidence: 99%
“…In [4], a direct multiple shooting approach is adapted to meet the specific requirements of NMPC. Sequential quadratic programming has also been successfully applied to this problem, e.g., [5,6]. A recent approach is sensitivity-based NMPC [7], whereby an approximate solution is calculated and then subsequently adjusted based on the sensitivity of the NLP to perturbations.…”
Section: Introductionmentioning
confidence: 99%