10 releases (6 breaking)

0.7.1 Mar 1, 2024
0.6.0 Sep 20, 2023
0.5.1 Jun 2, 2023
0.4.1 Mar 8, 2023
0.2.0 Jul 31, 2022

#169 in Math

Download history 1566/week @ 2024-01-22 1830/week @ 2024-01-29 1709/week @ 2024-02-05 2096/week @ 2024-02-12 2558/week @ 2024-02-19 2281/week @ 2024-02-26 2000/week @ 2024-03-04 1761/week @ 2024-03-11 1659/week @ 2024-03-18 1681/week @ 2024-03-25 2413/week @ 2024-04-01 2187/week @ 2024-04-08 2227/week @ 2024-04-15 2000/week @ 2024-04-22 1509/week @ 2024-04-29 2086/week @ 2024-05-06

7,939 downloads per month
Used in 3 crates (2 directly)

Apache-2.0

505KB
13K SLoC

Clarabel.jl logo

Interior Point Conic Optimization for Rust and Python

FeaturesInstallationLicenseDocumentation

Clarabel.rs is a Rust implementation of an interior point numerical solver for convex optimization problems using a novel homogeneous embedding. Clarabel.rs solves the following problem:

$$ \begin{array}{r} \text{minimize} & \frac{1}{2}x^T P x + q^T x\\[2ex] \text{subject to} & Ax + s = b \\[1ex] & s \in \mathcal{K} \end{array} $$

with decision variables $x \in \mathbb{R}^n$, $s \in \mathbb{R}^m$ and data matrices $P=P^\top \succeq 0$, $q \in \mathbb{R}^n$, $A \in \mathbb{R}^{m \times n}$, and $b \in \mathbb{R}^m$. The convex set $\mathcal{K}$ is a composition of convex cones.

For more information see the Clarabel Documentation (stable | dev).

Clarabel is also available in a Julia implementation. See here.

Features

  • Versatile: Clarabel.rs solves linear programs (LPs), quadratic programs (QPs), second-order cone programs (SOCPs) and semidefinite programs (SDPs). It also solves problems with exponential, power cone and generalized power cone constraints.
  • Quadratic objectives: Unlike interior point solvers based on the standard homogeneous self-dual embedding (HSDE), Clarabel.rs handles quadratic objectives without requiring any epigraphical reformulation of the objective. It can therefore be significantly faster than other HSDE-based solvers for problems with quadratic objective functions.
  • Infeasibility detection: Infeasible problems are detected using a homogeneous embedding technique.
  • Open Source: Our code is available on GitHub and distributed under the Apache 2.0 License

Installation

Clarabel can be imported to Cargo based Rust projects by adding

[dependencies]
clarabel = "0"  

to the project's Cargo.toml file. To install from source, see the Rust Installation Documentation.

To use the Python interface to the solver:

pip install clarabel

To install the Python interface from source, see the Python Installation Documentation.

License 🔍

This project is licensed under the Apache License 2.0 - see the LICENSE.md file for details.

Dependencies

~2–24MB
~266K SLoC