The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
An Accelerated Dual Gradient-Projection Algorithm for Embedded Linear Model Predictive Control
Abstract
This paper proposes a dual fast gradient-projection method for solving quadratic programming problems that arise in model predictive control of linear systems subject to general polyhedral constraints on inputs and states. The proposed algorithm is well suited for embedded control applications in that: 1) it is extremely simple and easy to code; 2) the number of iterations to reach a given accuracy in terms of optimality and feasibility of the primal solution can be tightly estimated; and 3) the computational cost per iteration increases only linearly with the prediction horizon.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
Model predictive control: Theory and practice—A survey
García, C. E., Prett, D. M., & Morari, M. (1989) · Automatica · doi:10.1016/0005-1098(89)90002-2 · Cited by 5,284
Predictive Control With Constraints
Maciejowski, J. M. (2001) · Cambridge University Engineering Department Publications Database · Cited by 4,368
Predictive control with constraints
Camacho, E. F. (2003) · Automatica · doi:10.1016/s0005-1098(03)00056-6 · Cited by 3,530
The explicit linear quadratic regulator for constrained systems
Bemporad, A., Morari, M., Dua, V., & Pistikopoulos, E. N. (2002) · Automatica · doi:10.1016/s0005-1098(01)00174-1 · Cited by 3,260
Self-citationControl of systems integrating logic, dynamics, and constraints
Bemporad, A., & Morari, M. (1999) · Automatica · doi:10.1016/s0005-1098(98)00178-2 · Cited by 3,066
Self-citationIntroductory Lectures on Convex Optimization
Nesterov, Y. (2004) · Applied Optimization · doi:10.1007/978-1-4419-8853-9 · Cited by 2,698
A method for solving the convex programming problem with convergence rate O(1/k^2)
Nesterov, Y. E. (1983) · Доклады Академии наук · Cited by 2,662
Smooth minimization of non-smooth functions
Nesterov, Y. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0552-5 · Cited by 2,455
Convex Analysis and Optimization
Bertsekas, D. P., Nedić, A., & Ozdaglar, A. (2003) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2,148
Parlar, M. (2000) · Interactive Operations Research with Maple · doi:10.1007/978-1-4612-1356-7_5 · Cited by 1,741
Fast Model Predictive Control Using Online Optimization
Wang, Y., & Boyd, S. (2010) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2009.2017934 · Cited by 1,372
CVXGEN: a code generator for embedded convex optimization
Mattingley, J., & Boyd, S. (2012) · Optimization and Engineering · doi:10.1007/s11081-011-9176-9 · Cited by 790
Convex Analysis and Global Optimization
Tụy, H. (1998) · Nonconvex optimization and its applications · doi:10.1007/978-1-4757-2809-5 · Cited by 618
An online active set strategy to overcome the limitations of explicit MPC
Ferreau, H. J., Bock, H. G., & Diehl, M. (2008) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.1251 · Cited by 608
Application of Interior-Point Methods to Model Predictive Control
Rao, C. V., Wright, S. J., & Rawlings, J. B. (1998) · Journal of Optimization Theory and Applications · doi:10.1023/a:1021711402723 · Cited by 536
Quadratic programming with one negative eigenvalue is NP-hard
Pardalos, P. M., & Vavasis, S. A. (1991) · Journal of Global Optimization · doi:10.1007/bf00120662 · Cited by 510
?BB: A global optimization method for general constrained nonconvex problems
Androulakis, I. P., Maranas, C. D., & Floudas, C. A. (1995) · Journal of Global Optimization · doi:10.1007/bf01099647 · Cited by 465
Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
Nedić, A., & Ozdaglar, A. (2009) · SIAM Journal on Optimization · doi:10.1137/070708111 · Cited by 399
Efficient interior point methods for multistage problems arising in receding horizon control
Domahidi, A., Zgraggen, A. U., Zeilinger, M. N., Morari, M., & Jones, C. N. (2012) · 2012 IEEE 51st IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426855 · Cited by 338
Pardalos, P. M. (2010) · Optimization Methods and Software · doi:10.1080/10556781003625177 · Cited by 328
Richter, S., Jones, C. N., & Morari, M. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2176389 · Cited by 291
Model Predictive Control Design: New Trends and Tools
Bemporad, A. (2006) · Proceedings of the 45th IEEE Conference on Decision and Control · doi:10.1109/cdc.2006.377490 · Cited by 198
Self-citationApplication of a Smoothing Technique to Decomposition in Convex Optimization
Necoara, I., & Suykens, J. A. K. (2008) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2007159 · Cited by 161
Real-time input-constrained MPC using fast gradient methods
Richter, S., Jones, C. N., & Morari, M. (2009) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2009.5400619 · Cited by 150
A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
Burer, S., & Vandenbussche, D. (2006) · Mathematical Programming · doi:10.1007/s10107-006-0080-6 · Cited by 145
Algorithms for linear programming with linear complementarity constraints
Júdice, J. J. (2011) · Top · doi:10.1007/s11750-011-0228-2 · Cited by 10
Cited by
ECOS: An SOCP solver for embedded systems
Domahidi, A., Chu, E., & Boyd, S. (2013) · 2013 European Control Conference (ECC) · doi:10.23919/ecc.2013.6669541 · Cited by 727
acados—a modular open-source framework for fast embedded optimal control
Verschueren, R., Frison, G., Kouzoupis, D., Frey, J., Duijkeren, N. V., Zanelli, A., Novoselnik, B., Albin, T., Quirynen, R., & Diehl, M. (2022) · Mathematical Programming Computation · doi:10.1007/s12532-021-00208-8 · Cited by 485
Reference and command governors for systems with constraints: A survey on theory and applications
Garone, E., Di Cairano, S., & Kolmanovsky, I. (2017) · Automatica · doi:10.1016/j.automatica.2016.08.013 · Cited by 466
Di Cairano, S., Bernardini, D., Bemporad, A., & Kolmanovsky, I. V. (2014) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2013.2272179 · Cited by 447
Self-citation
Metadata
- Authors
- Patrinos, P., & Bemporad, A.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2014-01
- Volume
- 59
- Issue
- 1
- Pages
- 18-33
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W1981832695
- Cited by
- 287
- References
- 27
- FWCI
- 44.72
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.