Struct argmin::solver::newton::newton_method::Newton [−][src]
pub struct Newton<F> { /* fields omitted */ }
Expand description
Newton’s method iteratively finds the stationary points of a function f by using a second order approximation of f at the current point.
References:
[0] Jorge Nocedal and Stephen J. Wright (2006). Numerical Optimization. Springer. ISBN 0-387-30303-0.
Implementations
impl<F: ArgminFloat> Newton<F>
[src]
impl<F: ArgminFloat> Newton<F>
[src]Trait Implementations
impl<F: ArgminFloat> Default for Newton<F>
[src]
impl<F: ArgminFloat> Default for Newton<F>
[src]impl<'de, F> Deserialize<'de> for Newton<F> where
F: Deserialize<'de>,
[src]
impl<'de, F> Deserialize<'de> for Newton<F> where
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<O, F> Solver<O> for Newton<F> where
O: ArgminOp<Float = F>,
O::Param: ArgminScaledSub<O::Param, O::Float, O::Param>,
O::Hessian: ArgminInv<O::Hessian> + ArgminDot<O::Param, O::Param>,
F: ArgminFloat,
[src]
impl<O, F> Solver<O> for Newton<F> where
O: ArgminOp<Float = F>,
O::Param: ArgminScaledSub<O::Param, O::Float, O::Param>,
O::Hessian: ArgminInv<O::Hessian> + ArgminDot<O::Param, O::Param>,
F: ArgminFloat,
[src]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 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 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<F> RefUnwindSafe for Newton<F> where
F: RefUnwindSafe,
F: RefUnwindSafe,
impl<F> Send for Newton<F> where
F: Send,
F: Send,
impl<F> Sync for Newton<F> where
F: Sync,
F: Sync,
impl<F> Unpin for Newton<F> where
F: Unpin,
F: Unpin,
impl<F> UnwindSafe for Newton<F> where
F: UnwindSafe,
F: 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,