Struct argmin::solver::linesearch::morethuente::MoreThuenteLineSearch [−][src]
pub struct MoreThuenteLineSearch<P, F> { /* fields omitted */ }
Expand description
The More-Thuente line search is a method to find a step length which obeys the strong Wolfe conditions.
References
This implementation follows the excellent MATLAB implementation of Dianne P. O’Leary at http://www.cs.umd.edu/users/oleary/software/
[0] Jorge J. More and David J. Thuente. “Line search algorithms with guaranteed sufficient decrease.” ACM Trans. Math. Softw. 20, 3 (September 1994), 286-307. DOI: https://doi.org/10.1145/192115.192132
Implementations
impl<P: Default, F: ArgminFloat> MoreThuenteLineSearch<P, F>
[src]
impl<P: Default, F: ArgminFloat> MoreThuenteLineSearch<P, F>
[src]Trait Implementations
impl<P, F> ArgminLineSearch<P, F> for MoreThuenteLineSearch<P, F> where
P: Clone + Serialize + ArgminSub<P, P> + ArgminDot<P, F> + ArgminScaledAdd<P, F, P>,
F: ArgminFloat,
[src]
impl<P, F> ArgminLineSearch<P, F> for MoreThuenteLineSearch<P, F> where
P: Clone + Serialize + ArgminSub<P, P> + ArgminDot<P, F> + ArgminScaledAdd<P, F, P>,
F: ArgminFloat,
[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, F: Clone> Clone for MoreThuenteLineSearch<P, F>
[src]
impl<P: Clone, F: Clone> Clone for MoreThuenteLineSearch<P, F>
[src]fn clone(&self) -> MoreThuenteLineSearch<P, F>
[src]
fn clone(&self) -> MoreThuenteLineSearch<P, 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<P: Default, F: ArgminFloat> Default for MoreThuenteLineSearch<P, F>
[src]
impl<P: Default, F: ArgminFloat> Default for MoreThuenteLineSearch<P, F>
[src]impl<'de, P, F> Deserialize<'de> for MoreThuenteLineSearch<P, F> where
P: Deserialize<'de>,
F: Deserialize<'de>,
[src]
impl<'de, P, F> Deserialize<'de> for MoreThuenteLineSearch<P, F> where
P: 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, F> Serialize for MoreThuenteLineSearch<P, F> where
P: Serialize,
F: Serialize,
[src]
impl<P, F> Serialize for MoreThuenteLineSearch<P, F> where
P: Serialize,
F: Serialize,
[src]impl<P, O, F> Solver<O> for MoreThuenteLineSearch<P, F> where
O: ArgminOp<Param = P, Output = F, Float = F>,
P: Clone + Serialize + DeserializeOwned + ArgminSub<P, P> + ArgminDot<P, F> + ArgminScaledAdd<P, F, P>,
F: ArgminFloat,
[src]
impl<P, O, F> Solver<O> for MoreThuenteLineSearch<P, F> where
O: ArgminOp<Param = P, Output = F, Float = F>,
P: Clone + Serialize + DeserializeOwned + ArgminSub<P, P> + ArgminDot<P, F> + ArgminScaledAdd<P, F, P>,
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_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
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
Auto Trait Implementations
impl<P, F> RefUnwindSafe for MoreThuenteLineSearch<P, F> where
F: RefUnwindSafe,
P: RefUnwindSafe,
F: RefUnwindSafe,
P: RefUnwindSafe,
impl<P, F> Send for MoreThuenteLineSearch<P, F> where
F: Send,
P: Send,
F: Send,
P: Send,
impl<P, F> Sync for MoreThuenteLineSearch<P, F> where
F: Sync,
P: Sync,
F: Sync,
P: Sync,
impl<P, F> Unpin for MoreThuenteLineSearch<P, F> where
F: Unpin,
P: Unpin,
F: Unpin,
P: Unpin,
impl<P, F> UnwindSafe for MoreThuenteLineSearch<P, F> where
F: UnwindSafe,
P: UnwindSafe,
F: 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,