CVXPY: A Python-Embedded Modeling Language for Convex Optimization

Abstract

CVXPY is a domain-specific language for convex optimization embedded in Python. It allows the user to express convex optimization problems in a natural syntax that follows the math, rather than in the restrictive standard form required by solvers. CVXPY makes it easy to combine convex optimization with high-level features of Python such as parallelism and object-oriented design. CVXPY is available at http://www.cvxpy.org/ under the GPL license, along with documentation and examples.

Updated to JMLR version

Cited by in corpus (68)

• OSQP: An Operator Splitting Solver for Quadratic Programs
• Fast Online Deconvolution of Calcium Imaging Data
• Demonstration of Universal Parametric Entangling Gates on a Multi-Qubit Lattice
• Accessibility of Cortical Regions to Focal TES: Dependence on Spatial Position, Safety, and Practical Constraints
• Large-Scale Convex Optimization for Dense Wireless Cooperative Networks
• Turning Optical Complex Media into Universal Reconfigurable Linear Operators by Wavefront Shaping
• Self-assembly of biomolecular condensates with shared components
• Distributionally Robust Joint Chance-Constrained Optimization for Networked Microgrids Considering Contingencies and Renewable Uncertainty
• Phase space simulation method for quantum computation with magic states on qubits
• Quasiprobability decompositions with reduced sampling overhead
• Anderson Accelerated Douglas-Rachford Splitting
• Neural Contraction Metrics for Robust Estimation and Control: A Convex Optimization Approach
• Simulation of Qubit Quantum Circuits via Pauli Propagation
• The Community Simulator: A Python package for microbial ecology
• Fairness and Sum-Rate Maximization via Joint Channel and Power Allocation in Uplink SCMA Networks
• Gym-ANM: Reinforcement Learning Environments for Active Network Management Tasks in Electricity Distribution Systems
• Robustness Verification of Quantum Classifiers
• Newton Polytopes and Relative Entropy Optimization
• Nonconvex Sparse Logistic Regression with Weakly Convex Regularization
• Distilling Information Reliability and Source Trustworthiness from Digital Traces
• EASE: Energy-Aware Job Scheduling for Vehicular Edge Networks With Renewable Energy Resources
• Edge-assisted Democratized Learning Towards Federated Analytics
• Least-Squares Temporal Difference Learning for the Linear Quadratic Regulator
• Adaptive sparse group LASSO in quantile regression
• Efficient Smoothed Concomitant Lasso Estimation for High Dimensional Regression
• Capacity-resolution trade-off in the optimal learning of multiple low-dimensional manifolds by attractor neural networks
• Predictive Online Convex Optimization
• Kernel-based Graph Learning from Smooth Signals: A Functional Viewpoint
• A Convex Optimization Approach to Radiation Treatment Planning with Dose Constraints
• Enhancing robustness and efficiency of density matrix embedding theory via semidefinite programming and local correlation potential fitting
• Autonomous estimation of high-dimensional Coulomb diamonds from sparse measurements
• Autonomous parafoil precision landing using convex real-time optimized guidance and control
• A Convex Approximation for the Tertiary Control of Unbalanced Microgrids
• Grid-Constrained Distributed Optimization for Frequency Control with Low-Voltage Flexibility
• Fitting quantum noise models to tomography data
• COHORT: Coordination of Heterogeneous Thermostatically Controlled Loads for Demand Flexibility
• Design and implementation of a modular interior-point solver for linear optimization
• Accounting for Model Uncertainty in Algorithmic Discrimination
• Loss-Aversively Fair Classification
• Stochastic optimal control using semidefinite programming for moment dynamics
• Global Optimization via the Dual SONC Cone and Linear Programming
• A Note on the Convexity of $\log \det (I+K{X}^{-1})$ and its Constrained Optimization Representation
• Estimation of Convex Polytopes for Automatic Discovery of Charge State Transitions in Quantum Dot Arrays
• Data-Driven Demand-Side Flexibility Quantification: Prediction and Approximation of Flexibility Envelopes
• Quantifying fermionic nonlinearity of quantum circuits
• Group Invariant Dictionary Learning
• GENO -- GENeric Optimization for Classical Machine Learning
• Partial Information Decomposition via Deficiency for Multivariate Gaussians
• Fast Partial Quantile Regression
• Convex programming with fast proximal and linear operators
• Estimating variances in time series linear regression models using empirical BLUPs and convex optimization
• Multi-Period Portfolio Optimization using Model Predictive Control with Mean-Variance and Risk Parity Frameworks
• ControlBurn: Feature Selection by Sparse Forests
• Comparative Study of Sampling-Based Simulation Costs of Noisy Quantum Circuits
• Sparse Coding of Shape Trajectories for Facial Expression and Action Recognition
• Multi-Objective SPIBB: Seldonian Offline Policy Improvement with Safety Constraints in Finite MDPs
• One Line To Rule Them All: Generating LO-Shot Soft-Label Prototypes
• Shift Happens: Adjusting Classifiers
• Stochastic Neural Networks for Automatic Cell Tracking in Microscopy Image Sequences of Bacterial Colonies
• Positivity-Preserving Adaptive Runge-Kutta Methods
• Modulus metrics on networks
• A mixture model for determining SARS-Cov-2 variant composition in pooled samples
• Product Manifold Learning
• Can Perceptual Guidance Lead to Semantically Explainable Adversarial Perturbations?
• Network Reconstruction Problem for an Epidemic Reaction-Diffusion
• Real-time Bidding for Time Constrained Impression Contracts in First and Second Price Auctions -- Theory and Algorithms
• High-resolution reconstruction of cellular traction-force distributions: the role of physically motivated constraints and compressive regularization
• On Convergence of Heuristics Based on Douglas-Rachford Splitting and ADMM to Minimize Convex Functions over Nonconvex Sets