CVXR
Disciplined Convex Optimization
An object-oriented modeling language for disciplined convex programming (DCP) as described in Fu, Narasimhan, and Boyd (2020, <doi:10.18637/jss.v094.i14>). It allows the user to formulate convex optimization problems in a natural way following mathematical convention and DCP rules. The system analyzes the problem, verifies its convexity, converts it into a canonical form, and hands it off to an appropriate solver to obtain the solution. This version uses the S7 object system for improved performance and maintainability.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
1.8.2 |
rolling linux/jammy R-4.5 | CVXR_1.8.2.tar.gz |
3.7 MiB |
1.8.2 |
rolling linux/noble R-4.5 | CVXR_1.8.2.tar.gz |
3.7 MiB |
1.8.2 |
rolling source/ R- | CVXR_1.8.2.tar.gz |
484.1 KiB |
1.8.2 |
latest linux/jammy R-4.5 | CVXR_1.8.2.tar.gz |
3.7 MiB |
1.8.2 |
latest linux/noble R-4.5 | CVXR_1.8.2.tar.gz |
3.7 MiB |
1.8.2 |
latest source/ R- | CVXR_1.8.2.tar.gz |
484.1 KiB |
1.8.2 |
2026-04-26 source/ R- | CVXR_1.8.2.tar.gz |
484.1 KiB |
1.8.2 |
2026-04-23 source/ R- | CVXR_1.8.2.tar.gz |
484.1 KiB |
1.8.2 |
2026-04-09 windows/windows R-4.5 | CVXR_1.8.2.zip |
4.1 MiB |
1.0-15 |
2025-04-20 source/ R- | CVXR_1.0-15.tar.gz |
981.0 KiB |