CVXGEN: a code generator for embedded convex optimization
From MaRDI portal
Publication:399985
DOI10.1007/S11081-011-9176-9zbMATH Open1293.65095OpenAlexW2117402460MaRDI QIDQ399985FDOQ399985
Authors: Jacob Mattingley, Stephen Boyd 
Publication date: 20 August 2014
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-011-9176-9
Recommendations
- CVXPY: a Python-embedded modeling language for convex optimization
- Construction of convex relaxations using automated code generation techniques
- Credible autocoding of convex optimization algorithms
- A generic coordinate descent solver for non-smooth convex optimisation
- Convex Synthesis of Accelerated Gradient Algorithms
- PCx: an interior-point code for linear programming
- The supporting hyperplane optimization toolkit for convex MINLP
- SnapVX: a network-based convex optimization solver
- Generalized convex programming
- PENNON: A code for convex nonlinear and semidefinite programming
Numerical optimization and variational techniques (65K10) Quadratic programming (90C20) Convex programming (90C25) Complexity and performance of numerical algorithms (65Y20)
Cites Work
- Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Disciplined convex programming
- Title not available (Why is that?)
- Numerical Optimization
- Title not available (Why is that?)
- On the Implementation of a Primal-Dual Interior Point Method
- Title not available (Why is that?)
- Linear Matrix Inequalities in System and Control Theory
- Title not available (Why is that?)
- Symmetric Quasidefinite Matrices
- Title not available (Why is that?)
- An introduction to support vector machines and other kernel-based learning methods.
- Title not available (Why is that?)
- Graph implementations for nonsmooth convex programs
- Necessary and sufficient conditions for a penalty method to be exact
- A note on the LDL\(^{T}\) decomposition of matrices from saddle-point problems
- Rate control for communication networks: shadow prices, proportional fairness and stability
- Title not available (Why is that?)
- Title not available (Why is that?)
- Designing optimal quantum detectors via semidefinite programming
- Symmetric indefinite systems for interior point methods
- Solution of sparse rectangular systems using LSQR and Craig
- Title not available (Why is that?)
- Optimization Methods in Finance
- Title not available (Why is that?)
- On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems
- Digital Circuit Optimization via Geometric Programming
Cited In (48)
- \texttt{acados} -- a modular open-source framework for fast embedded optimal control
- FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming
- Towards the Unification of Locomotion and Manipulation through Control Lyapunov Functions and Quadratic Programs
- Soft inequality constraints in gradient method and fast gradient method for quadratic programming
- Some applications of polynomial optimization in operations research and real-time decision making
- Spectral Computed Tomography with Linearization and Preconditioning
- Local linearization based subvector inference in moment inequality models
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
- Physical representation learning and parameter identification from video using differentiable physics
- Fast approximate \(L_\infty\) minimization: speeding up robust regression
- One-Step Estimation with Scaled Proximal Methods
- A simple effective heuristic for embedded mixed-integer quadratic programming
- Maximum divert for planetary landing using convex optimization
- CoG-PETS: code generation for parameter estimation in time series
- Recent advances in quadratic programming algorithms for nonlinear model predictive control
- Multi-period liability clearing via convex optimal control
- Quadratic approximate dynamic programming for input-affine systems
- Motion control of photovoltaic module dust cleaning robotic arm based on model predictive control
- Probabilistic performance validation of deep learning‐based robust NMPC controllers
- Online Mixed-Integer Optimization in Milliseconds
- Terminal spacecraft rendezvous and capture with LASSO model predictive control
- A convex programming approach to the inverse kinematics problem for manipulators under constraints
- Credible autocoding of convex optimization algorithms
- Linearly Constrained Linear Quadratic Regulator from the Viewpoint of Kernel Methods
- Multi-period portfolio selection with drawdown control
- CVXGEN
- Lossless convexification of non-convex optimal control problems for state constrained linear systems
- Nonconvex model predictive control for commercial refrigeration
- Matrix-Free Convex Optimization Modeling
- OSQP: An Operator Splitting Solver for Quadratic Programs
- Projection-free parallel quadratic programming for linear model predictive control
- A fast model-predictive speed controller for minimised charge consumption of electric vehicles
- Neutralizing zero dynamics attack on sampled-data systems via generalized holds
- PyEPO: a PyTorch-based end-to-end predict-then-optimize library for linear and integer programming
- Local Decay of Residuals in Dual Gradient Method with Soft State Constraints
- Automatically generated embedded model predictive control: Moving an industrial PC‐based MPC to an embedded platform
- Lossless convexification of optimal control problems with annular control constraints
- Field programmable gate array based predictive control system for spacecraft rendezvous in elliptical orbits
- Strong observability as a sufficient condition for non-singularity and lossless convexification in optimal control with mixed constraints
- Metric selection in fast dual forward-backward splitting
- Optimal current waveforms for brushless permanent magnet motors
- Generalized decomposition and cross entropy methods for many-objective optimization
- Relational linear programming
- Dynamic balance preservation and prevention of sliding for humanoid robots in the presence of multiple spatial contacts
- \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria
- Duality and Convex Programming
- Fast model predictive control with soft constraints
- Towards online model predictive control on a programmable logic controller: practical considerations
Uses Software
This page was built for publication: CVXGEN: a code generator for embedded convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q399985)
