Struct BacktrackingLineSearch 

pub struct BacktrackingLineSearch<V: Vector> {
    pub tau: V::T,
    pub c: V::T,
    pub steptol: V::T,
    pub max_iter: usize,
    pub n_iters: usize,
    /* private fields */
}

Backtracking line search implementation, derived from backtracking line search algorithm in Sundials IDA solver (https://github.com/LLNL/sundials/blob/main/src/ida/ida_ic.c#L480)

Parameters:

• tau: step size reduction factor (0 < tau < 1), default 0.5
• c: Armijo condition constant (0 < c < 1), default 1e-4
• steptol: minimum step size, default eps^(2/3)
• max_iter: maximum number of line search iterations, default 100
• n_iters: number of line search iterations performed during last call

Fields

tau: V::T

c: V::T

steptol: V::T

max_iter: usize

n_iters: usize

Trait Implementations

impl<V: Vector> Default for BacktrackingLineSearch<V>

fn default() -> Self

Returns the “default value” for a type.

impl<V: Vector> LineSearch<V> for BacktrackingLineSearch<V>

fn reset(&mut self)

Reset the line search state

fn take_optimal_step( &mut self, x: &mut V, delta: &mut V, error_y: &V, fun: &impl Fn(&V, &mut V), linear_solver: &impl Fn(&mut V) -> Result<(), DiffsolError>, convergence: &mut Convergence<'_, V>, ) -> Result<ConvergenceStatus, DiffsolError>

Take the optimal step for the current iteration