If you find Clarabel useful in your work, please consider citing one or more of the following papers. For the solver itself:

@misc{Clarabel_2024,
      title={Clarabel: An interior-point solver for conic programs with quadratic objectives}, 
      author={Paul J. Goulart and Yuwen Chen},
      year={2024},
      eprint={2405.12762},
      archivePrefix={arXiv},
      primaryClass={math.OC}
}

A preprint is available here.

If you use Clarabel to solve SDPs with decomposable structure:

@InProceedings{Garstka_2020,
  author  = {Michael Garstka and Mark Cannon and Paul Goulart},
  title   = {A clique graph based merging strategy for decomposable {SDPs}},
  year    = {2020},
  note    = {21th IFAC World Congress},
  number  = {2},
  pages   = {7355-7361},
  volume  = {53},
  doi     = {10.1016/j.ifacol.2020.12.1255},
  issn    = {2405-8963},
  journal = {IFAC-PapersOnLine},
}

A preprint is available here.

If you use Clarabel to solve problems with generalized power cones:

@misc{chen2023efficient,
      title={An Efficient IPM Implementation for A Class of Nonsymmetric Cones}, 
      author={Yuwen Chen and Paul Goulart},
      year={2023},
      eprint={2305.12275},
      archivePrefix={arXiv},
      primaryClass={math.OC}
}

A preprint is available here.