Struct argmin::solver::trustregion::steihaug::Steihaug [−][src]
pub struct Steihaug<P, F> { /* fields omitted */ }
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]
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]
__D: Deserializer<'de>,
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]
#[must_use]pub fn lt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]
pub fn lt(&self, other: &Rhs) -> bool#[must_use]pub fn le(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]
pub fn le(&self, other: &Rhs) -> bool#[must_use]pub fn gt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]
pub fn gt(&self, other: &Rhs) -> bool#[must_use]pub fn ge(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]
pub fn ge(&self, other: &Rhs) -> boolimpl<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]const NAME: &'static str
[src]
fn init(
&mut self,
_op: &mut OpWrapper<O>,
state: &IterState<O>
) -> Result<Option<ArgminIterData<O>>, Error>
[src]
&mut self,
_op: &mut OpWrapper<O>,
state: &IterState<O>
) -> Result<Option<ArgminIterData<O>>, Error>
fn next_iter(
&mut self,
_op: &mut OpWrapper<O>,
state: &IterState<O>
) -> Result<ArgminIterData<O>, Error>
[src]
&mut self,
_op: &mut OpWrapper<O>,
state: &IterState<O>
) -> Result<ArgminIterData<O>, Error>
fn terminate(&mut self, state: &IterState<O>) -> TerminationReason
[src]
fn terminate_internal(&mut self, state: &IterState<O>) -> TerminationReason
[src]
impl<P, F> StructuralPartialEq 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,
impl<P, F> RefUnwindSafe for Steihaug<P, F> where
F: RefUnwindSafe,
P: RefUnwindSafe,
impl<P, F> UnwindSafe for Steihaug<P, F> where
F: UnwindSafe,
P: UnwindSafe,
impl<P, F> UnwindSafe for Steihaug<P, F> where
F: UnwindSafe,
P: UnwindSafe,
Blanket Implementations
impl<T> DeserializeOwned for T where
T: for<'de> Deserialize<'de>,
[src]
impl<T> DeserializeOwned for T where
T: for<'de> Deserialize<'de>,
[src]impl<T> SendSyncUnwindSafe for T where
T: Send + Sync + UnwindSafe + ?Sized,
[src]
impl<T> SendSyncUnwindSafe for T where
T: Send + Sync + UnwindSafe + ?Sized,
[src]impl<V, T> VZip<V> for T where
V: MultiLane<T>,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,