Name
Abstract | ||
|---|---|---|
In this paper we analyze the advantages of describing the constraint set of a constrained optimization problem by an (inner-approximating) zonotope. We compare this with the usual polytopic description and note that by using the generator description characterizing zonotopes we can exploit their special structure in order to obtain a simpler formulation of the optimization problem. We test the results on a typical MPC setting and observe the improvements. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/CCA.2012.6402730 | CCA |
Keywords | Field | DocType |
approximation theory,computational geometry,predictive control,quadratic programming,set theory,MPC setting,constrained optimization problem,constraint set,generator description characterizing zonotopes,inner-approximating zonotope,polytopic description,qp optimization problem,zonotopic constraints | Set theory,Mathematical optimization,Computer science,Model predictive control,Computational geometry,Approximation theory,Exploit,Constrained optimization problem,Quadratic programming,Optimization problem | Conference |
ISSN | Citations | PageRank |
1085-1992 | 0 | 0.34 |
References | Authors | |
3 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Florin Stoican | 1 | 95 | 15.86 |
| Morten Hovd | 2 | 82 | 16.07 |