Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 1,265

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

qpOASES: a parametric active-set algorithm for quadratic programming

Ferreau, Hans Joachim, Kirches, Christian, Potschka, Andreas, Bock, Hans Georg, Diehl, Moritz·2014·Mathematical Programming Computation

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/s12532-014-0071-1

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 1 references

Research works printed but not linked: 49

  1. Anderson, E., Bai, Z., Bischof, C., Blackford, S., Demmel, J., Dongarra, J., Croz, J.D., Greenbaum, A., Hammarling, S., McKenney, A., Sorensen, D.: LAPACK Users’ Guide, 3rd edn. SIAM, Philadelphia, PA (1999) · DOI · Paper page
  2. Ängeby, J., Huschenbett, M., Alberer, D.: Automotive Model Predictive Control, MIMO Model Predictive Control for Integral Gas Engines. In: Lecture Notes in Control and Information Sciences, vol. 402, pp. 257–272, Springer, Berlin (2010) · doi:10.1007/978-1-84996-071-7_16
  3. Arnold, E., Neupert, J., Sawodny, O., Schneider, K.: Trajectory tracking for boom cranes based on nonlinear control and optimal trajectory generation. In: IEEE International Conference on Control Applications, pp. 1444–1449 (2007). doi: 10.1109/CCA.2007.4389439 · doi:10.1109/cca.2007.4389439
  4. Bartels, R., Golub, G.: The simplex method for linear programming using LU decomposition. Commun. ACM 12(5), 266–268 (1969) · doi:10.1145/362946.362974
  5. Bartlett, R., Biegler, L.: QPSchur: a dual, active set, Schur complement method for large-scale and structured convex quadratic programming algorithm. Optim. Eng. 7, 5–32 (2006) · doi:10.1007/s11081-006-6588-z
  6. Benzi, M., Golub, G., Liesen, J.: Numerical solution of saddle-point problems. Acta Numerica 14, 1–137 (2005) · DOI · Paper page
  7. Best, M.: An Algorithm for the Solution of the Parametric Quadratic Programming Problem. In: Applied Mathematics and Parallel Computing, pp. 57–76. Physica, Heidelberg (1996) · doi:10.1007/978-3-642-99789-1_5
  8. Blackford, L.S., Demmel, J., Dongarra, J., Duff, I.: An updated set of basic linear algebra subprograms (BLAS). ACM Trans. Math. Softw. 28, 135–151 (2002) · DOI · Paper page
  9. Bock, H., Plitt, K.: A multiple shooting algorithm for direct solution of optimal control problems. In: Proceedings 9th IFAC World Congress, pp. 242–247. Pergamon Press, Budapest (1984)
  10. Contesse, L.: Une charactérisation complète des minima locaux en programmation quadratique. Numerische Mathematik 34, 315–332 (1980) · doi:10.1007/bf01396705
  11. Dantzig, G.B.: Linear Programming and Extensions. Princeton University Press, Princeton (1963) · DOI · Paper page
  12. Diehl, M., Ferreau, H.J., Haverbeke, N.: Nonlinear model predictive control, Efficient Numerical Methods for Nonlinear MPC and Moving Horizon Estimation. In: Lecture Notes in Control and Information Sciences, vol. 384, pp. 391–417. Springer, Berlin (2009) · DOI · Paper page
  13. Ferreau, H.J.: An Online Active Set Strategy for Fast Solution of Parametric Quadratic Programs with Applications to Predictive Engine Control. Master’s thesis, University of Heidelberg (2006)
  14. Ferreau, H.J.: Model predictive control algorithms for applications with millisecond timescales. PhD thesis, KU Leuven (2011)
  15. Ferreau, H.J., Ortner, P., Langthaler, P., del Re, L., Diehl, M.: Predictive control of a real-world diesel engine using an extended online active set strategy. Annu. Rev. Control 31(2), 293–301 (2007) · doi:10.1016/j.arcontrol.2007.09.001
  16. Ferreau, H.J., Bock, H.G., Diehl, M.: An online active set strategy to overcome the limitations of explicit MPC. Int. J. Robust Nonlinear Control 18(8), 816–830 (2008) · DOI · Paper page
  17. Fletcher, R.: Practical Methods of Optimization, 2nd edn. Wiley, Chichester (1987)
  18. Fletcher, R.: Approximation Theory and Optimization, Dense factors of sparse matrices. In: Tributes to M.J.D. Powell, pp. 145–166. Cambridge University Press, Cambridge (1997)
  19. Fletcher, R., Matthews, S.: Stable modification of explicit LU factors for simplex updates. Math. Progr. 30(3), 267–284 (1984) · doi:10.1007/bf02591933
  20. Gertz, E., Wright, S.: Object-oriented software for quadratic programming. ACM Trans. Math. Softw. 29(1), 58–81 (2003) · DOI · Paper page
  21. Gill, P., Golub, G., Murray, W., Saunders, M.A.: Methods for modifying matrix factorizations. Math. Comput. 28(126), 505–535 (1974) · DOI · Paper page
  22. Gill, P., Murray, W., Saunders, M., Wright, M.: Procedures for optimization problems with a mixture of bounds and general linear constraints. ACM Trans. Math. Softw. 10(3), 282–298 (1984) · DOI
  23. Gill, P., Murray, W., Saunders, M., Wright, M.: Maintaining LU factors of a general sparse matrix. Linear Algebra Appl. 88(89), 239–270 (1987) · doi:10.1016/0024-3795(87)90112-1
  24. Goldfarb, D., Idnani, A.: A numerically stable dual method for solving strictly convex quadratic programs. Math. Progr. 27, 1–33 (1983) · DOI · Paper page
  25. Gould, N.: An algorithm for large-scale quadratic programming. IMA J. Numer. Anal. 11(3), 299–324 (1991) · doi:10.1093/imanum/11.3.299
  26. Harris, P.: Pivot selection methods of the DEVEXLP code. Math. Progr. 5, 1–29 (1973) · doi:10.1007/bf01580108
  27. Houska, B., Ferreau, H.J., Diehl, M.: ACADO Toolkit—an open source framework for automatic control and dynamic optimization. Optim. Control Appl. Methods 32(3), 298–312 (2011) · DOI · Paper page
  28. Huynh, H.: A large-scale quadratic programming solver based on block-LU updates of the KKT system. PhD thesis, Stanford University (2008)
  29. Inc TM: Real-Time Workshop for Use with SIMULINK, User’s Guide (1999)
  30. Karmarkar, N.: A new polynomial time algorithm for linear programming. Combinatorica 4, 373–395 (1984) · DOI · Paper page
  31. Kirches, C., Bock, H., Schlöder, J., Sager, S.: A factorization with update procedures for a KKT matrix arising in direct optimal control. Math. Progr. Comput. 3(4), 319–348 (2011) · doi:10.1007/s12532-011-0030-z
  32. Kostina, E.: The long step rule in the bounded-variable dual simplex method: numerical experiments. Math. Methods Oper. Res. 55(3), 413–429 (2002) · doi:10.1007/s001860200188
  33. Leineweber, D., Bauer, I., Schäfer, A., Bock, H., Schlöder, J.: An efficient multiple shooting based reduced SQP strategy for large-scale dynamic process optimization (parts I and II). Comput. Chem. Eng. 27, 157–174 (2003) · doi:10.1016/s0098-1354(02)00158-8
  34. Löfberg, J.: YALMIP: A toolbox for modeling and optimization in MATLAB. In: Proceedings of the CACSD Conference, Taipei, Taiwan (2004). http://users.isy.liu.se/johanl/yalmip
  35. Maros, I., Meszaros, C.: A repository of convex quadratic programming problems. Optim. Methods Softw. 11, 431–449 (1999) · doi:10.1080/10556789908805768
  36. Nesterov, Y.: Introductory lectures on convex optimization: a basic course. In: Applied Optimization, vol. 87. Kluwer Academic Publishers, Dordrecht (2003) · DOI · Paper page
  37. Nesterov, Y., Nemirovski, A.: Interior-point Polynomial Algorithms in Convex Programming. In: Society for Industrial Mathematics (1994) · DOI · Paper page
  38. Nocedal, J., Wright, S.: Springer series in operations research and financial engineering. In: Numerical Optimization, 2nd edn. Springer, Berlin (2006)
  39. Rauter, G., von Zitzewitz, J., Duschau-Wicke, A., Vallery, H., Riener, R.: A tendon-based parallel robot applied to motor learning in sports. In: Proceedings of the IEEE International Conference on Biomedical Robotics and Biomechatronics 2010, Japan (2010) · DOI · Paper page
  40. Rockafellar, R.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14, 877–898 (1976) · DOI · Paper page
  41. Sager, S.: Lange Schritte im Dualen Simplex-Algorithmus. Master’s thesis, Universität Heidelberg (2001)
  42. Takács, G., Rohal’-Ilkiv, B.: Predictive vibration control: efficient constrained MPC vibration control for lightly damped mechanical systems. Springer, Berlin (2012) · doi:10.1007/978-1-4471-2333-0
  43. Van den Broeck, L.: Time optimal control of mechatronic systems through embedded optimization. PhD thesis, KU Leuven (2011)
  44. Wang, X.: Resolution of Ties in Parametric Quadratic Programming. Master’s thesis, University of Waterloo, Ontario, Canada (2004)
  45. Wilkinson, J.: The Algebraic Eigenvalue Problem. Clarendon Press, Oxford (1965)
  46. Wills, A., Bates, D., Fleming, A., Ninness, B., Moheimani, S.: Application of MPC to an active structure using sampling rates up to 25kHz. In: 44th IEEE Conference on Decision and Control and European Control Conference ECC’05, Seville (2005)
  47. Wolfe, P.: The simplex method for quadratic programming. Econometrica 27, 382–398 (1959) · doi:10.2307/1909468
  48. Wright, S.: Primal-Dual Interior-Point Methods. SIAM Publications, Philadelphia (1997) · DOI · Paper page
  49. Wunderling, R.: Paralleler und Objektorientierter Simplex-Algorithmus. PhD thesis, Konrad-Zuse-Zentrum Berlin (1996)

Cited by

See all 1,265

Metadata

Authors
Ferreau, H. J., Kirches, C., Potschka, A., Bock, H. G., & Diehl, M.
Venue
Mathematical Programming Computation
Published
2014-04-30
Volume
6
Issue
4
Pages
327-363
ISSN
  • 1867-2949 (ISSN-L)
  • 1867-2957
OpenAlex
W2013439434
Cited by
1,265
References
1
FWCI
80.70
Type
journal article
Language
en
Open access
closed
Licence
www.springer.com/tdm (tdm)

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: qpOASES: a parametric active-set algorithm for quadratic programming. https://app.cochat.ai/papers/10.1007/s12532-014-0071-1
The paper
Ferreau, H. J., Kirches, C., Potschka, A., Bock, H. G., & Diehl, M. (2014). qpOASES: a parametric active-set algorithm for quadratic programming. Mathematical Programming Computation. https://doi.org/10.1007/s12532-014-0071-1

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.