CVXGEN: a code generator for embedded convex optimization
type: Item
instance of: scholarly article
title: CVXGEN: a code generator for embedded convex optimization
zbMATH Open document ID: 1293.65095
author: Jacob Mattingley
author: Stephen Boyd
published in: Optimization and Engineering
publication date: 2014-08-20T00:00:00Z
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 6332896
zbMATH Keywords: convex optimization
zbMATH Keywords: code generation
zbMATH Keywords: embedded optimization
describes a project that uses: CHOLMOD
describes a project that uses: YALMIP
describes a project that uses: QDES
describes a project that uses: UMFPACK
describes a project that uses: SDPT3
describes a project that uses: CVXOPT
describes a project that uses: CVX
describes a project that uses: CVXMOD
describes a project that uses: YACC
describes a project that uses: fast_mpc
describes a project that uses: SeDuMi
MaRDI profile type: Publication
full work available at URL: s11081-011-9176-9
OpenAlex ID: W2117402460
cites work: Q4227354
cites work: Necessary and sufficient conditions for a penalty method to be exact
cites work: Q4003797
cites work: Q4821526
cites work: Linear Matrix Inequalities in System and Control Theory
cites work: Digital Circuit Optimization via Geometric Programming
cites work: An introduction to support vector machines and other kernel-based learning methods.
cites work: Optimization Methods in Finance
cites work: Q4851575
cites work: Q4692656
cites work: Designing optimal quantum detectors via semidefinite programming
cites work: Graph Implementations for Nonsmooth Convex Programs
cites work: Q5492525
cites work: On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems
cites work: Rate control for communication networks: shadow prices, proportional fairness and stability
cites work: On the Implementation of a Primal-Dual Interior Point Method
cites work: Q4324980
cites work: Numerical Optimization
cites work: Solution of sparse rectangular systems using LSQR and Craig
cites work: Q3125518
cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
cites work: Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
cites work: A note on the LDL\(^{T}\) decomposition of matrices from saddle-point problems
cites work: Symmetric Quasidefinite Matrices
cites work: Q4935997
cites work: Symmetric indefinite systems for interior point methods
cites work: Q5691079
cites work: Q4382667
DOI: 10.1007/S11081-011-9176-9
Recommended article: CVXPY: a Python-embedded modeling language for convex optimization
Recommended article: Construction of convex relaxations using automated code generation techniques
Recommended article: Credible autocoding of convex optimization algorithms
Recommended article: A generic coordinate descent solver for non-smooth convex optimisation
Recommended article: Convex Synthesis of Accelerated Gradient Algorithms
Recommended article: PCx: an interior-point code for linear programming
Recommended article: The supporting hyperplane optimization toolkit for convex MINLP
Recommended article: SnapVX: A Network-Based Convex Optimization Solver
Recommended article: Generalized convex programming
Recommended article: PENNON: A code for convex nonlinear and semidefinite programming
description: scientific article; zbMATH DE number 6332896