ClarabelSolver

<p>A persistent Clarabel solver that can be reused across R calls.</p>

datasets

A versatile interior point solver that solves linear programs (LPs), quadratic programs (QPs), second-order cone programs (SOCPs), semidefinite programs (SDPs), and problems with exponential and power cone constraints (<https://clarabel.org/stable/>). For quadratic objectives, unlike interior point solvers based on the standard homogeneous self-dual embedding (HSDE) model, Clarabel handles quadratic objective without requiring any epigraphical reformulation of its objective function. It can therefore be significantly faster than other HSDE-based solvers for problems with quadratic objective functions. Infeasible problems are detected using using a homogeneous embedding technique.

Balasubramanian Narasimhan

clarabel

Interior Point Conic Optimization Solver

Paul Goulart

Yuwen Chen

Hiroaki Yutani

David Zimmermann-Kollenda

The authors of the dependency Rust crates 

ClarabelSolver function

<p>An object of class <code>clarabel::ClarabelSolver__bundle</code> (inherits from <code>savvy_clarabel__sealed</code>) of length 1.</p>

Format

A persistent Clarabel solver that can be reused across R calls. — ClarabelSolver

A persistent Clarabel solver that can be reused across R calls.

ClarabelSolver: A persistent Clarabel solver that can be reused across R calls.

Description

Usage

Arguments

Format