pub struct ClarabelSolver(/* private fields */);Expand description
A solver implementation that uses the Clarabel interior point method for quadratic programming to solve the market clearing problem.
This solver is generally more accurate but can be slower than ADMM-based solvers for large problems. It’s a good choice when high precision is needed.
Trait Implementations§
Source§impl Default for ClarabelSolver
impl Default for ClarabelSolver
Source§impl Solver for ClarabelSolver
impl Solver for ClarabelSolver
Source§type Settings = DefaultSettings<f64>
type Settings = DefaultSettings<f64>
The configuration type for this solver
Auto Trait Implementations§
impl Freeze for ClarabelSolver
impl RefUnwindSafe for ClarabelSolver
impl Send for ClarabelSolver
impl Sync for ClarabelSolver
impl Unpin for ClarabelSolver
impl UnwindSafe for ClarabelSolver
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more