From d00f1274a5c1f52519f17c5e93a38dc52ddfa7f3 Mon Sep 17 00:00:00 2001 From: Danny Tse Date: Thu, 26 Dec 2024 02:17:03 -0500 Subject: [PATCH] updated readme --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 8fe775a..2e8e808 100644 --- a/README.md +++ b/README.md @@ -47,7 +47,7 @@ The set $\mathcal{K}$ is a composition of convex cones; we support zero cones (l - __clarabel-gpu.jl__ can be added via the Julia package manager (type `]`): `pkg> dev https://github.com/cvxgrp/clarabel-gpu.git`, (which will overwrite current use of Clarabel solver). ## Tutorial -Modeling a conic optimization problem is the same as in original [Clarabel solver](https://clarabel.org/stable/), except with the additional parameter `direct_solve_method`. This can be set to `:cudss` or `:cudssmixed`. Here is a portfolio optimization problem modelled via JuMP: +Modeling a conic optimization problem is the same as in the original [Clarabel solver](https://clarabel.org/stable/), except with the additional parameter `direct_solve_method`. This can be set to `:cudss` or `:cudssmixed`. Here is a portfolio optimization problem modelled via JuMP: ``` using LinearAlgebra, SparseArrays, Random, JuMP using Clarabel