clarabel 0.3.0

Clarabel Conic Interior Point Solver for Rust / Python
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28

import clarabel;
import numpy as np;
from scipy import sparse;

# Define problem data
P = sparse.csc_matrix([[3., 0.], [0., 2.]]);
P = sparse.triu(P).tocsc();

q = np.array([-1.,-4.]);

A = sparse.csc_matrix( \
    [[ 1., -2.],        #<-- LHS of equality constraint (lower bound)
     [ 1.,  0.],        #<-- LHS of inequality constraint (upper bound)
     [ 0.,  1.],        #<-- LHS of inequality constraint (upper bound)
     [-1.,  0.],        #<-- LHS of inequality constraint (lower bound)
     [ 0., -1.]]);      #<-- LHS of inequality constraint (lower bound)

b = np.array([0.,1.,1.,1.,1.]);

cones = [clarabel.ZeroConeT(1), clarabel.NonnegativeConeT(4)]
settings = clarabel.DefaultSettings();

solver = clarabel.DefaultSolver(P,q,A,b,cones,settings);
solution = solver.solve()
print(
    f"Solver terminated with status: {solution.status}, objective {solution.obj_val},\n"
    f"and solution: {dict(s=solution.s, x=solution.x, z=solution.z)}"
)