Journal
OPTIMIZATION AND ENGINEERING
Volume 13, Issue 1, Pages 1-27Publisher
SPRINGER
DOI: 10.1007/s11081-011-9176-9
Keywords
Convex optimization; Code generation; Embedded optimization
Categories
Funding
- JPL [1400723]
- NASA [NNX07AEIIA]
- Lucent Technologies Stanford Graduate Fellowship
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available