pub struct ConstrainedGaussianRemlForwardProblem<'a> {
pub x: ArrayView2<'a, f64>,
pub y: ArrayView2<'a, f64>,
pub penalty: ArrayView2<'a, f64>,
pub weights: Option<ArrayView1<'a, f64>>,
pub constraints: Option<&'a LinearInequalityConstraints>,
pub init_lambda: Option<f64>,
}Expand description
Inputs to the single-penalty constrained Gaussian REML fit.
The public operation defines one criterion in both regimes: ordinary closed-form Gaussian REML when the unconstrained optimum is interior, and the exact affine-face restriction of that same criterion when constraints bind. There is deliberately no generic-GAM rho prior, shrinkage floor, or ALO correction hidden in this low-level primitive.
Fields§
§x: ArrayView2<'a, f64>§y: ArrayView2<'a, f64>§penalty: ArrayView2<'a, f64>§weights: Option<ArrayView1<'a, f64>>§constraints: Option<&'a LinearInequalityConstraints>§init_lambda: Option<f64>Auto Trait Implementations§
impl<'a> Freeze for ConstrainedGaussianRemlForwardProblem<'a>
impl<'a> RefUnwindSafe for ConstrainedGaussianRemlForwardProblem<'a>
impl<'a> Send for ConstrainedGaussianRemlForwardProblem<'a>
impl<'a> Sync for ConstrainedGaussianRemlForwardProblem<'a>
impl<'a> Unpin for ConstrainedGaussianRemlForwardProblem<'a>
impl<'a> UnsafeUnpin for ConstrainedGaussianRemlForwardProblem<'a>
impl<'a> UnwindSafe for ConstrainedGaussianRemlForwardProblem<'a>
Blanket Implementations§
impl<T> Allocation for T
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T, U> Imply<T> for U
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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.