CVXPY 1.9: Recent Advances in Optimization Modeling Software

2026-06-12

AI Summary

This work addresses the limitations of existing convex optimization modeling languages in expressiveness, solver efficiency, and problem coverage by extending the CVXPY system to establish a unified modeling and solving framework. The proposed approach introduces canonical conic quadratic programming forms, native N-dimensional expressions, explicit sparse variables, multi-attribute variables, quantum information–related cones and atoms, and a disciplined nonlinear programming (DNLP) mechanism. Coupled with a stacked-slicing backend that accelerates parameterized problems, this framework enables efficient automatic translation from user-friendly mathematical descriptions to solver-compatible inputs. The resulting system substantially enhances modeling flexibility and computational performance while broadening the scope of tractable problems, demonstrating particular advantages in quantum information applications and large-scale parametric optimization scenarios.

Abstract

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.

Problem

• convex optimization
• optimization modeling
• disciplined nonlinear programming
• parameterized programs
• sparsity

Innovation

• conic quadratic program
• stacked-slices backend
• N-dimensional expressions
• explicit sparsity
• disciplined nonlinear programming