Struct argmin::solver::linesearch::BacktrackingLineSearch
source · [−]pub struct BacktrackingLineSearch<P, G, L, F> { /* private fields */ }
Expand description
Backtracking line search
The Backtracking line search is a method which finds a step length from a given point along a given direction, such that this step length obeys the Armijo (sufficient decrease) condition.
Requirements on the optimization problem
The optimization problem is required to implement CostFunction
and Gradient
.
References
Jorge Nocedal and Stephen J. Wright (2006). Numerical Optimization. Springer. ISBN 0-387-30303-0.
Wikipedia: https://en.wikipedia.org/wiki/Backtracking_line_search
Implementations
sourceimpl<P, G, L, F> BacktrackingLineSearch<P, G, L, F> where
F: ArgminFloat,
impl<P, G, L, F> BacktrackingLineSearch<P, G, L, F> where
F: ArgminFloat,
Trait Implementations
sourceimpl<P: Clone, G: Clone, L: Clone, F: Clone> Clone for BacktrackingLineSearch<P, G, L, F>
impl<P: Clone, G: Clone, L: Clone, F: Clone> Clone for BacktrackingLineSearch<P, G, L, F>
sourcefn clone(&self) -> BacktrackingLineSearch<P, G, L, F>
fn clone(&self) -> BacktrackingLineSearch<P, G, L, F>
Returns a copy of the value. Read more
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source
. Read more
sourceimpl<'de, P, G, L, F> Deserialize<'de> for BacktrackingLineSearch<P, G, L, F> where
P: Deserialize<'de>,
G: Deserialize<'de>,
L: Deserialize<'de>,
F: Deserialize<'de>,
impl<'de, P, G, L, F> Deserialize<'de> for BacktrackingLineSearch<P, G, L, F> where
P: Deserialize<'de>,
G: Deserialize<'de>,
L: Deserialize<'de>,
F: Deserialize<'de>,
sourcefn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
sourceimpl<P, G, L, F> LineSearch<P, F> for BacktrackingLineSearch<P, G, L, F> where
F: ArgminFloat,
impl<P, G, L, F> LineSearch<P, F> for BacktrackingLineSearch<P, G, L, F> where
F: ArgminFloat,
sourcefn search_direction(&mut self, search_direction: P)
fn search_direction(&mut self, search_direction: P)
Set search direction
sourcefn initial_step_length(&mut self, alpha: F) -> Result<(), Error>
fn initial_step_length(&mut self, alpha: F) -> Result<(), Error>
Set initial step length
sourceimpl<P: PartialEq, G: PartialEq, L: PartialEq, F: PartialEq> PartialEq<BacktrackingLineSearch<P, G, L, F>> for BacktrackingLineSearch<P, G, L, F>
impl<P: PartialEq, G: PartialEq, L: PartialEq, F: PartialEq> PartialEq<BacktrackingLineSearch<P, G, L, F>> for BacktrackingLineSearch<P, G, L, F>
sourcefn eq(&self, other: &BacktrackingLineSearch<P, G, L, F>) -> bool
fn eq(&self, other: &BacktrackingLineSearch<P, G, L, F>) -> bool
This method tests for self
and other
values to be equal, and is used
by ==
. Read more
sourcefn ne(&self, other: &BacktrackingLineSearch<P, G, L, F>) -> bool
fn ne(&self, other: &BacktrackingLineSearch<P, G, L, F>) -> bool
This method tests for !=
.
sourceimpl<P, G, L, F> Serialize for BacktrackingLineSearch<P, G, L, F> where
P: Serialize,
G: Serialize,
L: Serialize,
F: Serialize,
impl<P, G, L, F> Serialize for BacktrackingLineSearch<P, G, L, F> where
P: Serialize,
G: Serialize,
L: Serialize,
F: Serialize,
sourceimpl<O, P, G, L, F> Solver<O, IterState<P, G, (), (), F>> for BacktrackingLineSearch<P, G, L, F> where
P: Clone + SerializeAlias + ArgminScaledAdd<P, F, P>,
G: SerializeAlias + ArgminScaledAdd<P, F, P>,
O: CostFunction<Param = P, Output = F> + Gradient<Param = P, Gradient = G>,
L: LineSearchCondition<P, G, F> + SerializeAlias,
F: ArgminFloat,
impl<O, P, G, L, F> Solver<O, IterState<P, G, (), (), F>> for BacktrackingLineSearch<P, G, L, F> where
P: Clone + SerializeAlias + ArgminScaledAdd<P, F, P>,
G: SerializeAlias + ArgminScaledAdd<P, F, P>,
O: CostFunction<Param = P, Output = F> + Gradient<Param = P, Gradient = G>,
L: LineSearchCondition<P, G, F> + SerializeAlias,
F: ArgminFloat,
sourceconst NAME: &'static str = "Backtracking line search"
const NAME: &'static str = "Backtracking line search"
Name of the solver. Mainly used in Observers.
sourcefn init(
&mut self,
problem: &mut Problem<O>,
state: IterState<P, G, (), (), F>
) -> Result<(IterState<P, G, (), (), F>, Option<KV>), Error>
fn init(
&mut self,
problem: &mut Problem<O>,
state: IterState<P, G, (), (), F>
) -> Result<(IterState<P, G, (), (), F>, Option<KV>), Error>
Initializes the algorithm. Read more
sourcefn next_iter(
&mut self,
problem: &mut Problem<O>,
state: IterState<P, G, (), (), F>
) -> Result<(IterState<P, G, (), (), F>, Option<KV>), Error>
fn next_iter(
&mut self,
problem: &mut Problem<O>,
state: IterState<P, G, (), (), F>
) -> Result<(IterState<P, G, (), (), F>, Option<KV>), Error>
sourcefn terminate(&mut self, state: &IterState<P, G, (), (), F>) -> TerminationReason
fn terminate(&mut self, state: &IterState<P, G, (), (), F>) -> TerminationReason
Used to implement stopping criteria, in particular criteria which are not covered by
(terminate_internal
. Read more
sourcefn terminate_internal(&mut self, state: &I) -> TerminationReason
fn terminate_internal(&mut self, state: &I) -> TerminationReason
Checks whether basic termination reasons apply. Read more
impl<P: Eq, G: Eq, L: Eq, F: Eq> Eq for BacktrackingLineSearch<P, G, L, F>
impl<P, G, L, F> StructuralEq for BacktrackingLineSearch<P, G, L, F>
impl<P, G, L, F> StructuralPartialEq for BacktrackingLineSearch<P, G, L, F>
Auto Trait Implementations
impl<P, G, L, F> RefUnwindSafe for BacktrackingLineSearch<P, G, L, F> where
F: RefUnwindSafe,
G: RefUnwindSafe,
L: RefUnwindSafe,
P: RefUnwindSafe,
impl<P, G, L, F> Send for BacktrackingLineSearch<P, G, L, F> where
F: Send,
G: Send,
L: Send,
P: Send,
impl<P, G, L, F> Sync for BacktrackingLineSearch<P, G, L, F> where
F: Sync,
G: Sync,
L: Sync,
P: Sync,
impl<P, G, L, F> Unpin for BacktrackingLineSearch<P, G, L, F> where
F: Unpin,
G: Unpin,
L: Unpin,
P: Unpin,
impl<P, G, L, F> UnwindSafe for BacktrackingLineSearch<P, G, L, F> where
F: UnwindSafe,
G: UnwindSafe,
L: UnwindSafe,
P: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more