CVXPY: A Python-Embedded Modeling Language for Convex Optimization
By Steven Diamond, Stephen P. Boyd. 2016
3,152 citations recorded by the source corpus.
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.
Subfields: Computational Mechanics, Computational Theory and Mathematics, Numerical Analysis
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Mechanics
- Brendan O'Donoghue
- B. Recht
- Stephen P. Boyd
- Martin J. Wainwright
- John C. Duchi
- J. Kolter
- Percy Liang
- Nadav Cohen
In Computational Theory and Mathematics
- Brendan O'Donoghue
- Stephen P. Boyd
- Steven Diamond
- Percy Liang
- Martin J. Wainwright
- Jaehyun Park
- B. Recht
- Thomas Lipp
In Numerical Analysis
- Brendan O'Donoghue
- Stephen P. Boyd
- Steven Diamond
- Shane T. Barratt
- Percy Liang
- Alberto Bemporad
- Martin J. Wainwright
- Vlad Niculae
Citations in the corpus
- Certified Defenses for Data Poisoning Attacks (2017, methodology): “…+1 , − 1 } and take the one with higher loss: The results of Algorithm 1 are given in Figures 2a and 2b; here and elsewhere, we used a combination of CVXPY (Diamond and Boyd, 2016), YALMIP (Löfberg, 2004), SeDuMi (Sturm, 1999), and Gurobi (Gurobi Optimization, Inc., 2016) to solve the optimization.”
- Causal Modeling-Based Discrimination Discovery and Removal: Criteria, Bounds, and Algorithms (2019, methodology): “The quadratic programming is solved using CVXOPT [43].”
- Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding (2013, methodology): “It is now the default solver for CVXPY and Convex.jl for problems that cannot be expressed using the standard symmetric cones.”
- OSQP: an operator splitting solver for quadratic programs (2017, methodology): “Users can call OSQP from C, C++, Fortran, Python, Matlab, R, Julia, Ruby and Rust, and via parsers such as CVXPY [1,26], JuMP [33], and YALMIP [65].”
- KETO: Learning Keypoint Representations for Tool Manipulation (2019, background): “3 that can be solved using CVXPY [13] in a few milliseconds.”
- Regret Bounds for Robust Adaptive Control of the Linear Quadratic Regulator (2018, methodology): “For our experiments, we used the SCS solver [19] via CVXPY [9].”
- Learning Binary Trees via Sparse Relaxation (2020, methodology): “We compare its solving time with the time needed by the popular convex optimization framework Cvxpy (Diamond & Boyd, 2016; Agrawal et al., 2018) to solve Problem 3 with OSQP solver (Stellato et al., 2020) 4 .”
- Implicit Regularization in Deep Matrix Factorization (2019, methodology): “Our implementation is based on Python, with PyTorch ([40]) for realizing deep matrix factorizations and CVXPY ([13, 2]) for finding minimum nuclear norm solutions.”
- Operator Splitting for a Homogeneous Embedding of the Linear Complementarity Problem (2020, methodology): “It can be used in other C, C++, Python, MATLAB, R, Julia, and Ruby programs and is a supported solver in parser-solvers CVX [31], CVXPY [18], Convex.jl [73], JuMP [21], and YALMIP [39].”
- A Convex Relaxation Barrier to Tight Robustness Verification of Neural Networks (2019, methodology): “We construct all the LP models in python using CVXPY [Diamond and Boyd, 2016], and the models are solved using an open-source solver, ECOS [Domahidi et al.”
- Optimized Pre-Processing for Discrimination Prevention (2017, methodology): “For each train/test split, we approximate pD,X,Y using the empirical distribution of (D,X, Y ) in the training set and solve (6) using a standard convex solver [Diamond and Boyd, 2016].”
- Variations and extension of the convex–concave procedure (2016, methodology): “Small problem instance computational details The subproblems were solved using CVXPY (Diamond et al. 2014; Diamond and Boyd 2015) as the interface to the ECOS solver (Domahidi et al.”
- Solving Mixed Integer Programs Using Neural Networks (2020, methodology): “The true objective values were found by solving the same LPs using the high-accuracy ECOS interior point solver (Domahidi et al. 2013) with parser-solver CVXPY (Diamond and Boyd 2016).”
- Polyhedral approximation in mixed-integer convex optimization (2016, methodology): “Users need only express their MICP problem by using a DCP modeling language like CVX or more recent implementations like CVXPY [14] (in Python), or Convex.jl [ 43] (in Julia).”