pub struct SR1Update {
pub b: Array2<f64>,
pub n: usize,
pub r: f64,
}Expand description
Symmetric rank-1 (SR1) Hessian update.
Maintains an approximation B ≈ H updated by:
Bₖ₊₁ = Bₖ + (y - B s)(y - B s)ᵀ / (y - B s)ᵀ sSR1 can approximate indefinite Hessians (unlike BFGS) and often achieves better Hessian quality than BFGS when used inside a trust-region framework.
The update is skipped when |(y - Bs)ᵀ s| < r ‖y - Bs‖ ‖s‖ (default r=1e-8)
to avoid numerical instabilities.
Fields§
§b: Array2<f64>Current Hessian approximation B
n: usizeDimension
r: f64Skip-update safeguard parameter
Implementations§
Trait Implementations§
Source§impl HessianApproximation for SR1Update
impl HessianApproximation for SR1Update
Source§fn update(&mut self, s: &[f64], y: &[f64]) -> Result<(), OptimizeError>
fn update(&mut self, s: &[f64], y: &[f64]) -> Result<(), OptimizeError>
Update the approximation given a new step-curvature pair. Read more
Source§fn multiply(&self, v: &[f64]) -> Result<Vec<f64>, OptimizeError>
fn multiply(&self, v: &[f64]) -> Result<Vec<f64>, OptimizeError>
Compute
H v (Hessian times vector).Source§fn inverse_multiply(&self, v: &[f64]) -> Result<Vec<f64>, OptimizeError>
fn inverse_multiply(&self, v: &[f64]) -> Result<Vec<f64>, OptimizeError>
Compute
H⁻¹ v (inverse Hessian times vector).Auto Trait Implementations§
impl Freeze for SR1Update
impl RefUnwindSafe for SR1Update
impl Send for SR1Update
impl Sync for SR1Update
impl Unpin for SR1Update
impl UnsafeUnpin for SR1Update
impl UnwindSafe for SR1Update
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> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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
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.