Struct argmin::solver::trustregion::steihaug::Steihaug [−][src]
pub struct Steihaug<P, F> { /* fields omitted */ }
Expand description
The Steihaug method is a conjugate gradients based approach for finding an approximate solution to the second order approximation of the cost function within the trust region.
References:
[0] Jorge Nocedal and Stephen J. Wright (2006). Numerical Optimization. Springer. ISBN 0-387-30303-0.
Implementations
impl<P, F> Steihaug<P, F> where
P: Default + Clone + ArgminMul<F, P> + ArgminDot<P, F> + ArgminAdd<P, P>,
F: ArgminFloat,
[src]
impl<P, F> Steihaug<P, F> where
P: Default + Clone + ArgminMul<F, P> + ArgminDot<P, F> + ArgminAdd<P, P>,
F: ArgminFloat,
[src]Trait Implementations
impl<P: Clone + Serialize, F: ArgminFloat> ArgminTrustRegion<F> for Steihaug<P, F>
[src]
impl<P: Clone + Serialize, F: ArgminFloat> ArgminTrustRegion<F> for Steihaug<P, F>
[src]fn set_radius(&mut self, radius: F)
[src]
fn set_radius(&mut self, radius: F)
[src]Set the initial step length
impl<'de, P, F> Deserialize<'de> for Steihaug<P, F> where
P: Deserialize<'de>,
F: Deserialize<'de>,
[src]
impl<'de, P, F> Deserialize<'de> for Steihaug<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: PartialOrd, F: PartialOrd> PartialOrd<Steihaug<P, F>> for Steihaug<P, F>
[src]
impl<P: PartialOrd, F: PartialOrd> PartialOrd<Steihaug<P, F>> for Steihaug<P, F>
[src]fn partial_cmp(&self, other: &Steihaug<P, F>) -> Option<Ordering>
[src]
fn partial_cmp(&self, other: &Steihaug<P, F>) -> Option<Ordering>
[src]This method returns an ordering between self
and other
values if one exists. Read more
#[must_use]fn lt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]fn lt(&self, other: &Rhs) -> bool
1.0.0[src]This method tests less than (for self
and other
) and is used by the <
operator. Read more
#[must_use]fn le(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]fn le(&self, other: &Rhs) -> bool
1.0.0[src]This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
impl<P, O, F> Solver<O> for Steihaug<P, F> where
O: ArgminOp<Param = P, Output = F, Float = F>,
P: Clone + Serialize + DeserializeOwned + Default + ArgminMul<F, P> + ArgminWeightedDot<P, F, O::Hessian> + ArgminNorm<F> + ArgminDot<P, F> + ArgminAdd<P, P> + ArgminSub<P, P> + ArgminZeroLike,
O::Hessian: ArgminDot<P, P>,
F: ArgminFloat,
[src]
impl<P, O, F> Solver<O> for Steihaug<P, F> where
O: ArgminOp<Param = P, Output = F, Float = F>,
P: Clone + Serialize + DeserializeOwned + Default + ArgminMul<F, P> + ArgminWeightedDot<P, F, O::Hessian> + ArgminNorm<F> + ArgminDot<P, F> + ArgminAdd<P, P> + ArgminSub<P, P> + ArgminZeroLike,
O::Hessian: ArgminDot<P, 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(&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
impl<P: Copy, F: Copy> Copy for Steihaug<P, F>
[src]
impl<P, F> StructuralPartialEq for Steihaug<P, F>
[src]
Auto Trait Implementations
impl<P, F> RefUnwindSafe for Steihaug<P, F> where
F: RefUnwindSafe,
P: RefUnwindSafe,
F: RefUnwindSafe,
P: RefUnwindSafe,
impl<P, F> Send for Steihaug<P, F> where
F: Send,
P: Send,
F: Send,
P: Send,
impl<P, F> Sync for Steihaug<P, F> where
F: Sync,
P: Sync,
F: Sync,
P: Sync,
impl<P, F> Unpin for Steihaug<P, F> where
F: Unpin,
P: Unpin,
F: Unpin,
P: Unpin,
impl<P, F> UnwindSafe for Steihaug<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,