Struct argmin::solver::linesearch::backtracking::BacktrackingLineSearch[][src]

pub struct BacktrackingLineSearch<P, L, F> { /* fields omitted */ }
Expand description

The Backtracking line search is a simple method to find a step length which obeys the Armijo (sufficient decrease) condition.

Example

References:

[0] Jorge Nocedal and Stephen J. Wright (2006). Numerical Optimization. Springer. ISBN 0-387-30303-0.

[1] Wikipedia: https://en.wikipedia.org/wiki/Backtracking_line_search

Implementations

Constructor

Set rho

Trait Implementations

Set search direction

Set initial alpha value

Returns a copy of the value. Read more

Performs copy-assignment from source. Read more

Deserialize this value from the given Serde deserializer. Read more

Serialize this value into the given Serde serializer. Read more

Name of the solver

Initializes the algorithm Read more

Computes one iteration of the algorithm.

Checks whether the algorithm must be terminated

Checks whether basic termination reasons apply. Read more

Auto Trait Implementations

Blanket Implementations

Gets the TypeId of self. Read more

Immutably borrows from an owned value. Read more

Mutably borrows from an owned value. Read more

Performs the conversion.

Performs the conversion.

The resulting type after obtaining ownership.

Creates owned data from borrowed data, usually by cloning. Read more

🔬 This is a nightly-only experimental API. (toowned_clone_into)

recently added

Uses borrowed data to replace owned data, usually by cloning. Read more

The type returned in the event of a conversion error.

Performs the conversion.

The type returned in the event of a conversion error.

Performs the conversion.