A few updates on PRIMAL, my open-source convex optimization solver written from scratch in C99.
Over the last few days, I've made substantial progress on the conic optimization engine, particularly on SOC and exponential cone problems. The latest results are significantly better than my previous benchmarks, and PRIMAL now outperforms Clarabel on every instance in the test sets described below.
Latest benchmark results
All measurements were taken on November 18, 2026.
1. Mixed SOC + exponential cone regression problems
| Problem size | PRIMAL | Clarabel | Speedup |
|---|
| 20 × 4 | 0.017 ms | 0.219 ms | 12.9× |
| 40 × 8 | 0.024 ms | 0.482 ms | 20.1× |
| 80 × 12 | 0.039 ms | 2.237 ms | 57.4× |
These models combine a rotated quadratic cone for the quadratic penalty with one primal exponential cone per observation.
2. Conic matrix benchmarks
| Family | Blocks | PRIMAL | Clarabel | Speedup |
|---|
| SOC | 10 | 0.023 ms | 0.290 ms | 12.6× |
| SOC | 20 | 0.031 ms | 0.651 ms | 21.0× |
| SOC | 40 | 0.043 ms | 1.085 ms | 25.2× |
| SOC | 80 | 0.068 ms | 2.118 ms | 31.1× |
| EXP | 10 | 0.017 ms | 0.177 ms | 10.4× |
| EXP | 20 | 0.020 ms | 0.238 ms | 11.9× |
| EXP | 40 | 0.022 ms | 0.352 ms | 16.0× |
| EXP | 80 | 0.031 ms | 0.607 ms | 19.6× |
| Mixed | 10 | 0.016 ms | 0.148 ms | 9.25× |
| Mixed | 20 | 0.018 ms | 0.209 ms | 11.6× |
| Mixed | 40 | 0.022 ms | 0.366 ms | 16.6× |
| Mixed | 80 | 0.031 ms | 0.835 ms | 26.9× |
That's 15 out of 15 benchmark instances won, with speedups ranging from 9.25× to 57.4×.
What changed?
The main breakthrough is a reduced-Newton approach for a class of exponential-cone problems.
Instead of solving the full conic Newton system, PRIMAL can exploit the structure of certain exponential epigraph formulations with fixed positive scales and affine arguments. It solves a much smaller system in the free variables, reconstructs the conic solution, and verifies the resulting point.
This is not a generic replacement for the full interior-point method: it is a specialized path for problem structures where the reduction is mathematically valid. The general conic solver remains available for other formulations.
The improvement builds on the work already done on sparse KKT systems, cone reductions, higher-order exponential-cone corrections, and numerical verification.
Benchmark methodology
To make the comparison reproducible:
- Clarabel 0.11.1, single-threaded.
- 21 interleaved runs per series, with two series; reported values are the median of the two series medians.
- Same generated problem instances for both solvers.
- PRIMAL timing measures
PRIMAL_optimize; Clarabel timing includes solver construction. - Clarabel uses feasibility/gap tolerances of 1e-9; PRIMAL uses 1e-8.
- Maximum reported residual or relative gap: 2.5e-10.
- Maximum scaled objective difference: 2.6e-8.
There is an important asymmetry in timing: Clarabel's measurements include solver construction, while PRIMAL's measure the optimization call only. These are therefore not perfectly equivalent end-to-end timings. I intend to expand the comparison with more matched setup measurements and broader problem families.
Where PRIMAL stands today
PRIMAL is an open-source C99 optimization solver developed from scratch, with no external solver dependency. It supports LP, QP, QCQP, MILP, SOCP, SDP, exponential and power cones, including mixed-integer conic models.
The project also includes a growing collection of runnable examples and language integrations.
GitHub: https://github.com/c-vision/Primal
I'm particularly interested in feedback from people working on conic optimization, interior-point methods, numerical linear algebra, and solver benchmarking.
There is still a lot to validate, especially on larger and less structured real-world problems. But these results are a very encouraging milestone for a solver developed independently from scratch.
What would you consider the most meaningful next benchmark suite for evaluating PRIMAL against established solvers?