CVXPY 1.9: Recent Advances in Optimization Modeling Software
Not on the map. Why?
Abstract (arXiv)
CVXPY is a Python-embedded domain-specific language for convex optimization that lets users express problems in mathematical notation while the system verifies convexity and reduces valid programs to solver-ready form. This paper reports on the major advances from versions 1.1 through 1.9. These include a unified conic quadratic program (CQP) standard form for canonicalization; a stacked-slices backend that accelerates parameterized programs; first-class support for N-dimensional expressions; explicit sparsity for variables; support for multiple variable attributes; cones/atoms relevant to quantum information theory; and the introduction of disciplined nonlinear programming (DNLP). We outline the design, algorithms, and modeling consequences of these features.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 12 Jun 2026.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Disciplined Bilevel Programmingcited by 0
- 2026Disciplined Bilevel Programming1 Sep 2026