{
  "abstract": "We present a general-purpose interior-point solver for convex optimization problems with conic constraints. Our method is based on a homogeneous embedding method originally developed for general monotone complementarity problems and more recently applied to operator splitting methods, and here specialized to an interior-point method for problems with quadratic objectives. We allow for a variety of standard symmetric and non-symmetric cones, and provide support for chordal decomposition methods in the case of semidefinite cones. We describe the implementation of this method in the open-source solver Clarabel , and provide a detailed numerical evaluation of its performance versus several state-of-the-art solvers on a wide range of standard benchmark problems. Clarabel is faster than competing commercial and open-source solvers across a range of test sets with quadratic objectives, and remains competitive for problems with linear objectives even at large scale. Clarabel is currently distributed as a default solver for the Python Cvxpy optimization suite.",
  "abstract_shown": true,
  "affiliations": [
    "University of Oxford, Oxford, UK"
  ],
  "article_type": null,
  "arxiv": null,
  "author_total": 2,
  "authors": [
    {
      "affs": [
        0
      ],
      "name": "Paul J. Goulart",
      "orcid": "0000-0002-0456-4124"
    },
    {
      "affs": [
        0
      ],
      "name": "Yuwen Chen",
      "orcid": "0000-0003-3129-7698"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/9ty5eqq86x7sa.bib",
  "cited_by": 214,
  "doi": "10.1007/s12532-026-00320-7",
  "fulltext_url": null,
  "id": "9ty5eqq86x7sa",
  "issns": [
    "1867-2949",
    "1867-2957"
  ],
  "landing_url": "https://doi.org/10.1007/s12532-026-00320-7",
  "language": "en",
  "licence": "CC-BY",
  "licence_label": "CC BY",
  "licence_source": "journal",
  "licence_url": "https://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": null,
  "native_subjects": [
    [
      "openalex",
      "2612|Advanced Optimization Algorithms Research"
    ]
  ],
  "openalex": "W7161939507",
  "pdf_url": "https://link.springer.com/content/pdf/10.1007/s12532-026-00320-7.pdf",
  "pmcid": null,
  "pmid": null,
  "published": "2026-05-21",
  "publisher": "Springer Science+Business Media",
  "ris": "https://research.draconitic.com/paper/9ty5eqq86x7sa.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:17:17Z",
      "native_id": "W7161939507",
      "source": "openalex",
      "url": "https://doi.org/10.1007/s12532-026-00320-7"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "openalex:2612|Advanced Optimization Algorithms Research",
      "subfield": "numerical-analysis"
    }
  ],
  "title": "Clarabel: An interior-point solver for conic programs with quadratic objectives",
  "title_text": "Clarabel: An interior-point solver for conic programs with quadratic objectives",
  "type": "peer-reviewed",
  "updated_at": "2026-11-08T13:20:35Z",
  "url": "https://research.draconitic.com/paper/9ty5eqq86x7sa",
  "venue": "Mathematical Programming Computation",
  "versions": []
}