pub struct ClarabelExpertInfor3rd {
pub result: Option<Topp3Profile>,
pub solution: DefaultSolution<f64>,
pub linsolver: LinearSolverInfo,
}Expand description
Clarabel expert result for third-order optimization backends.
This extends the public expert tuple (Option<Topp3Profile>, DefaultSolution<f64>)
with solver-side metadata that Clarabel stores outside DefaultSolution.
The high-level result field is Some(Topp3Profile { .. }) only when
the solver status is accepted by the provided ClarabelOptions.
Fields§
§result: Option<Topp3Profile>Accepted third-order profile, or None when
the solver status is not accepted.
solution: DefaultSolution<f64>Raw Clarabel solution, including primal/dual/slack vectors and status.
linsolver: LinearSolverInfoClarabel linear-solver metadata captured before the solver object is consumed.
Auto Trait Implementations§
impl Freeze for ClarabelExpertInfor3rd
impl RefUnwindSafe for ClarabelExpertInfor3rd
impl Send for ClarabelExpertInfor3rd
impl Sync for ClarabelExpertInfor3rd
impl Unpin for ClarabelExpertInfor3rd
impl UnwindSafe for ClarabelExpertInfor3rd
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§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.