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.
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
impl<P: Default, L, F: ArgminFloat> BacktrackingLineSearch<P, L, F>
[src]
impl<P: Default, L, F: ArgminFloat> BacktrackingLineSearch<P, L, F>
[src]Trait Implementations
impl<P, L, F> ArgminLineSearch<P, F> for BacktrackingLineSearch<P, L, F> where
P: Clone + Serialize + ArgminSub<P, P> + ArgminDot<P, f64> + ArgminScaledAdd<P, f64, P>,
L: LineSearchCondition<P, F>,
F: ArgminFloat + Serialize + DeserializeOwned,
[src]
impl<P, L, F> ArgminLineSearch<P, F> for BacktrackingLineSearch<P, L, F> where
P: Clone + Serialize + ArgminSub<P, P> + ArgminDot<P, f64> + ArgminScaledAdd<P, f64, P>,
L: LineSearchCondition<P, F>,
F: ArgminFloat + Serialize + DeserializeOwned,
[src]fn set_search_direction(&mut self, search_direction: P)
[src]
fn set_search_direction(&mut self, search_direction: P)
[src]Set search direction
fn set_init_alpha(&mut self, alpha: F) -> Result<(), Error>
[src]
fn set_init_alpha(&mut self, alpha: F) -> Result<(), Error>
[src]Set initial alpha value
impl<P: Clone, L: Clone, F: Clone> Clone for BacktrackingLineSearch<P, L, F>
[src]
impl<P: Clone, L: Clone, F: Clone> Clone for BacktrackingLineSearch<P, L, F>
[src]fn clone(&self) -> BacktrackingLineSearch<P, L, F>
[src]
fn clone(&self) -> BacktrackingLineSearch<P, L, F>
[src]Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]Performs copy-assignment from source
. Read more
impl<'de, P, L, F> Deserialize<'de> for BacktrackingLineSearch<P, L, F> where
P: Deserialize<'de>,
L: Deserialize<'de>,
F: Deserialize<'de>,
[src]
impl<'de, P, L, F> Deserialize<'de> for BacktrackingLineSearch<P, L, F> where
P: Deserialize<'de>,
L: Deserialize<'de>,
F: Deserialize<'de>,
[src]fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
[src]
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
[src]Deserialize this value from the given Serde deserializer. Read more
impl<P, L, F> Serialize for BacktrackingLineSearch<P, L, F> where
P: Serialize,
L: Serialize,
F: Serialize,
[src]
impl<P, L, F> Serialize for BacktrackingLineSearch<P, L, F> where
P: Serialize,
L: Serialize,
F: Serialize,
[src]impl<O, P, L, F> Solver<O> for BacktrackingLineSearch<P, L, F> where
P: Clone + Default + Serialize + DeserializeOwned + ArgminSub<P, P> + ArgminDot<P, F> + ArgminScaledAdd<P, F, P>,
O: ArgminOp<Param = P, Output = F, Float = F>,
L: LineSearchCondition<P, F>,
F: ArgminFloat,
[src]
impl<O, P, L, F> Solver<O> for BacktrackingLineSearch<P, L, F> where
P: Clone + Default + Serialize + DeserializeOwned + ArgminSub<P, P> + ArgminDot<P, F> + ArgminScaledAdd<P, F, P>,
O: ArgminOp<Param = P, Output = F, Float = F>,
L: LineSearchCondition<P, F>,
F: ArgminFloat,
[src]fn init(
&mut self,
op: &mut OpWrapper<O>,
state: &IterState<O>
) -> Result<Option<ArgminIterData<O>>, Error>
[src]
fn init(
&mut self,
op: &mut OpWrapper<O>,
state: &IterState<O>
) -> Result<Option<ArgminIterData<O>>, Error>
[src]Initializes the algorithm Read more
fn next_iter(
&mut self,
op: &mut OpWrapper<O>,
_state: &IterState<O>
) -> Result<ArgminIterData<O>, Error>
[src]
fn next_iter(
&mut self,
op: &mut OpWrapper<O>,
_state: &IterState<O>
) -> Result<ArgminIterData<O>, Error>
[src]Computes one iteration of the algorithm.
fn terminate(&mut self, state: &IterState<O>) -> TerminationReason
[src]
fn terminate(&mut self, state: &IterState<O>) -> TerminationReason
[src]Checks whether the algorithm must be terminated
fn terminate_internal(&mut self, state: &IterState<O>) -> TerminationReason
[src]
fn terminate_internal(&mut self, state: &IterState<O>) -> TerminationReason
[src]Checks whether basic termination reasons apply. Read more
Auto Trait Implementations
impl<P, L, F> RefUnwindSafe for BacktrackingLineSearch<P, L, F> where
F: RefUnwindSafe,
L: RefUnwindSafe,
P: RefUnwindSafe,
F: RefUnwindSafe,
L: RefUnwindSafe,
P: RefUnwindSafe,
impl<P, L, F> Send for BacktrackingLineSearch<P, L, F> where
F: Send,
L: Send,
P: Send,
F: Send,
L: Send,
P: Send,
impl<P, L, F> Sync for BacktrackingLineSearch<P, L, F> where
F: Sync,
L: Sync,
P: Sync,
F: Sync,
L: Sync,
P: Sync,
impl<P, L, F> Unpin for BacktrackingLineSearch<P, L, F> where
F: Unpin,
P: Unpin,
F: Unpin,
P: Unpin,
impl<P, L, F> UnwindSafe for BacktrackingLineSearch<P, L, F> where
F: UnwindSafe,
L: UnwindSafe,
P: UnwindSafe,
F: UnwindSafe,
L: UnwindSafe,
P: UnwindSafe,
Blanket Implementations
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]pub fn borrow_mut(&mut self) -> &mut T
[src]
pub fn borrow_mut(&mut self) -> &mut T
[src]Mutably borrows from an owned value. Read more
impl<T> ToOwned for T where
T: Clone,
[src]
impl<T> ToOwned for T where
T: Clone,
[src]type Owned = T
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn to_owned(&self) -> T
[src]Creates owned data from borrowed data, usually by cloning. Read more
pub fn clone_into(&self, target: &mut T)
[src]
pub fn clone_into(&self, target: &mut T)
[src]🔬 This is a nightly-only experimental API. (toowned_clone_into
)
recently added
Uses borrowed data to replace owned data, usually by cloning. Read more
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
pub fn vzip(self) -> V
impl<T> DeserializeOwned for T where
T: for<'de> Deserialize<'de>,
[src]
T: for<'de> Deserialize<'de>,
impl<T> SendSyncUnwindSafe for T where
T: Send + Sync + UnwindSafe + ?Sized,
[src]
T: Send + Sync + UnwindSafe + ?Sized,