Struct fenris_optimize::newton::BacktrackingLineSearch [−][src]
pub struct BacktrackingLineSearch;Expand description
Standard backtracking line search using the Armijo condition.
See Jorge & Nocedal (2006), Numerical Optimization, Chapter 3.1. #[derive(Clone, Debug)]
Trait Implementations
impl<T, F> LineSearch<T, F> for BacktrackingLineSearch where
T: RealField,
F: VectorFunction<T>,
impl<T, F> LineSearch<T, F> for BacktrackingLineSearch where
T: RealField,
F: VectorFunction<T>,
fn step(
&mut self,
function: &mut F,
f: DVectorSliceMut<'_, T>,
x: DVectorSliceMut<'_, T>,
direction: DVectorSlice<'_, T>
) -> Result<T, Box<dyn Error>>
Auto Trait Implementations
impl RefUnwindSafe for BacktrackingLineSearch
impl Send for BacktrackingLineSearch
impl Sync for BacktrackingLineSearch
impl Unpin for BacktrackingLineSearch
impl UnwindSafe for BacktrackingLineSearch
Blanket Implementations
Mutably borrows from an owned value. Read more
The inverse inclusion map: attempts to construct self from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self is actually part of its subset T (and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self to the equivalent element of its superset.