Proceedings of the 48h IEEE Conference on Decision and Control (CDC) Held Jointly With 2009 28th Chinese Control Conference 2009
DOI: 10.1109/cdc.2009.5400440
|View full text |Cite
|
Sign up to set email alerts
|

A primal-dual interior-point linear programming algorithm for MPC

Abstract: Abstract-Constrained optimal control problems for linear systems with linear constraints and an objective function consisting of linear and l1-norm terms can be expressed as linear programs. We develop an efficient primal-dual interior point algorithm for solution of such linear programs. The algorithm is implemented in Matlab and its performance is compared to an active set based LP solver and linprog in Matlab's optimization toolbox. Simulations demonstrate that the new algorithm is more than one magnitude f… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
3
3
2

Relationship

2
6

Authors

Journals

citations
Cited by 11 publications
(5 citation statements)
references
References 13 publications
0
5
0
Order By: Relevance
“…We use a damping parameter, ν, to keep the iterates well inside the interior of the non-negative orthant (w,s,τ,κ) ≥ 0, as they approach the solution. To speed-up numerical computations and reduce the storage requirements of LPempc, operations involving the structured matrices F and H are implemented as specialized linear algebra routines [28].…”
Section: A Interior Point Methodsmentioning
confidence: 99%
“…We use a damping parameter, ν, to keep the iterates well inside the interior of the non-negative orthant (w,s,τ,κ) ≥ 0, as they approach the solution. To speed-up numerical computations and reduce the storage requirements of LPempc, operations involving the structured matrices F and H are implemented as specialized linear algebra routines [28].…”
Section: A Interior Point Methodsmentioning
confidence: 99%
“…e above optimization problem is a typical convex quadratic programming problem with linear constraints. Some previous works [32,33] have provided the methods to solve this kind of problem, and we will not repeat them here.…”
Section: Objective Function and Optimization Problemmentioning
confidence: 99%
“…Traditionally, MPC is designed using objective functions penalizing deviations from a given set-point. MPC based on optimizing economic objectives has only recently emerged as a general methodology with efficient numerical implementations and provable stability properties [10]- [13]. The idea of utilizing load shifting capabilities to reduce total energy consumption is slowly gaining acceptance (see [14], [15]).…”
Section: Introductionmentioning
confidence: 99%