CVXGEN

CVXGEN: a code generator for embedded convex optimization. CVXGEN is a software tool that takes a high level description of a convex optimization problem family, and automatically generates custom C code that compiles into a reliable, high speed solver for the problem family. The current implementation targets problem families that can be transformed, using disciplined convex programming techniques, to convex quadratic programs of modest size. CVXGEN generates simple, flat, library-free code suitable for embedding in real-time applications. The generated code is almost branch free, and so has highly predictable run-time behavior. The combination of regularization (both static and dynamic) and iterative refinement in the search direction computation yields reliable performance, even with poor quality data. In this paper we describe how CVXGEN is implemented, and give some results on the speed and reliability of the automatically generated solvers.


References in zbMATH (referenced in 26 articles , 2 standard articles )

Showing results 1 to 20 of 26.
Sorted by year (citations)

1 2 next

  1. Amir Ali Ahmadi, Anirudha Majumdar: DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization (2017) arXiv
  2. Kersting, Kristian; Mladenov, Martin; Tokmakov, Pavel: Relational linear programming (2017)
  3. Ahmadi, Amir Ali; Majumdar, Anirudha: Some applications of polynomial optimization in operations research and real-time decision making (2016)
  4. Diamond, Steven; Boyd, Stephen: Matrix-free convex optimization modeling (2016)
  5. Schwickart, Tim; Voos, Holger; Hadji-Minaglou, Jean-Régis; Darouach, Mohamed: A fast model-predictive speed controller for minimised charge consumption of electric vehicles (2016)
  6. Wang, Timothy; Jobredeaux, Romain; Pantel, Marc; Garoche, Pierre-Loic; Feron, Eric; Henrion, Didier: Credible autocoding of convex optimization algorithms (2016)
  7. Borwein, Jonathan M.; Luke, D.Russell: Duality and convex programming (2015)
  8. Frasch, Janick V.; Sager, Sebastian; Diehl, Moritz: A parallel quadratic programming method for dynamic optimization problems (2015)
  9. Giselsson, Pontus; Boyd, Stephen: Metric selection in fast dual forward-backward splitting (2015)
  10. Hartley, Edward N.; Maciejowski, Jan M.: Field programmable gate array based predictive control system for spacecraft rendezvous in elliptical orbits (2015)
  11. Herceg, M.; Jones, C.N.; Morari, M.: Dominant speed factors of active set methods for fast MPC (2015)
  12. Kufoalor, D.K.M.; Aaker, V.; Johansen, T.A.; Imsland, L.; Eikrem, G.O.: Automatically generated embedded model predictive control: moving an industrial PC-based MPC to an embedded platform (2015)
  13. Quirynen, Rien; Vukov, Milan; Diehl, Moritz: Multiple shooting in a microsecond (2015)
  14. Quirynen, R.; Vukov, M.; Zanon, M.; Diehl, M.: Autogenerating microsecond solvers for nonlinear MPC: a tutorial using ACADO integrators (2015)
  15. Giagkiozis, I.; Purshouse, R.C.; Fleming, P.J.: Generalized decomposition and cross entropy methods for many-objective optimization (2014)
  16. Harris, Matthew W.; Açıkmeşe, Behçet: Maximum divert for planetary landing using convex optimization (2014)
  17. Harris, Matthew W.; Açıkmeşe, Behçet: Lossless convexification of non-convex optimal control problems for state constrained linear systems (2014)
  18. Keshavarz, Arezou; Boyd, Stephen: Quadratic approximate dynamic programming for input-affine systems (2014)
  19. Patrinos, Panagiotis; Bemporad, Alberto: An accelerated dual gradient-projection algorithm for embedded linear model predictive control (2014)
  20. Sun, Ju; Zhang, Yuqian; Wright, John: Efficient point-to-subspace query in $\ell^1$ with application to robust object instance recognition (2014)

1 2 next