Struct argmin::solver::trustregion::cauchypoint::CauchyPoint
source · [−]pub struct CauchyPoint<F> { /* private fields */ }
Expand description
The Cauchy point is the minimum of the quadratic approximation of the cost function within the trust region along the direction given by the first derivative.
References:
[0] Jorge Nocedal and Stephen J. Wright (2006). Numerical Optimization. Springer. ISBN 0-387-30303-0.
Implementations
sourceimpl<F: ArgminFloat> CauchyPoint<F>
impl<F: ArgminFloat> CauchyPoint<F>
Trait Implementations
sourceimpl<F: ArgminFloat> ArgminTrustRegion<F> for CauchyPoint<F>
impl<F: ArgminFloat> ArgminTrustRegion<F> for CauchyPoint<F>
sourcefn set_radius(&mut self, radius: F)
fn set_radius(&mut self, radius: F)
Set the initial step length
sourceimpl<F: Clone> Clone for CauchyPoint<F>
impl<F: Clone> Clone for CauchyPoint<F>
sourcefn clone(&self) -> CauchyPoint<F>
fn clone(&self) -> CauchyPoint<F>
Returns a copy of the value. Read more
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source
. Read more
sourceimpl<F: Debug> Debug for CauchyPoint<F>
impl<F: Debug> Debug for CauchyPoint<F>
sourceimpl<F: Default> Default for CauchyPoint<F>
impl<F: Default> Default for CauchyPoint<F>
sourcefn default() -> CauchyPoint<F>
fn default() -> CauchyPoint<F>
Returns the “default value” for a type. Read more
sourceimpl<'de, F> Deserialize<'de> for CauchyPoint<F> where
F: Deserialize<'de>,
impl<'de, F> Deserialize<'de> for CauchyPoint<F> where
F: Deserialize<'de>,
sourcefn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
sourceimpl<F: PartialEq> PartialEq<CauchyPoint<F>> for CauchyPoint<F>
impl<F: PartialEq> PartialEq<CauchyPoint<F>> for CauchyPoint<F>
sourcefn eq(&self, other: &CauchyPoint<F>) -> bool
fn eq(&self, other: &CauchyPoint<F>) -> bool
This method tests for self
and other
values to be equal, and is used
by ==
. Read more
sourcefn ne(&self, other: &CauchyPoint<F>) -> bool
fn ne(&self, other: &CauchyPoint<F>) -> bool
This method tests for !=
.
sourceimpl<F: PartialOrd> PartialOrd<CauchyPoint<F>> for CauchyPoint<F>
impl<F: PartialOrd> PartialOrd<CauchyPoint<F>> for CauchyPoint<F>
sourcefn partial_cmp(&self, other: &CauchyPoint<F>) -> Option<Ordering>
fn partial_cmp(&self, other: &CauchyPoint<F>) -> Option<Ordering>
This method returns an ordering between self
and other
values if one exists. Read more
1.0.0 · sourcefn lt(&self, other: &Rhs) -> bool
fn lt(&self, other: &Rhs) -> bool
This method tests less than (for self
and other
) and is used by the <
operator. Read more
1.0.0 · sourcefn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
sourceimpl<F> Serialize for CauchyPoint<F> where
F: Serialize,
impl<F> Serialize for CauchyPoint<F> where
F: Serialize,
sourceimpl<O, F> Solver<O> for CauchyPoint<F> where
O: ArgminOp<Output = F, Float = F>,
O::Param: Debug + Clone + Serialize + ArgminMul<O::Float, O::Param> + ArgminWeightedDot<O::Param, F, O::Hessian> + ArgminNorm<O::Float>,
O::Hessian: Clone + Serialize,
F: ArgminFloat,
impl<O, F> Solver<O> for CauchyPoint<F> where
O: ArgminOp<Output = F, Float = F>,
O::Param: Debug + Clone + Serialize + ArgminMul<O::Float, O::Param> + ArgminWeightedDot<O::Param, F, O::Hessian> + ArgminNorm<O::Float>,
O::Hessian: Clone + Serialize,
F: ArgminFloat,
sourcefn next_iter(
&mut self,
op: &mut OpWrapper<O>,
state: &IterState<O>
) -> Result<ArgminIterData<O>, Error>
fn next_iter(
&mut self,
op: &mut OpWrapper<O>,
state: &IterState<O>
) -> Result<ArgminIterData<O>, Error>
Computes one iteration of the algorithm.
sourcefn terminate(&mut self, state: &IterState<O>) -> TerminationReason
fn terminate(&mut self, state: &IterState<O>) -> TerminationReason
Checks whether the algorithm must be terminated
sourcefn init(
&mut self,
_op: &mut OpWrapper<O>,
_state: &IterState<O>
) -> Result<Option<ArgminIterData<O>>, Error>
fn init(
&mut self,
_op: &mut OpWrapper<O>,
_state: &IterState<O>
) -> Result<Option<ArgminIterData<O>>, Error>
Initializes the algorithm Read more
sourcefn terminate_internal(&mut self, state: &IterState<O>) -> TerminationReason
fn terminate_internal(&mut self, state: &IterState<O>) -> TerminationReason
Checks whether basic termination reasons apply. Read more
impl<F: Copy> Copy for CauchyPoint<F>
impl<F> StructuralPartialEq for CauchyPoint<F>
Auto Trait Implementations
impl<F> RefUnwindSafe for CauchyPoint<F> where
F: RefUnwindSafe,
impl<F> Send for CauchyPoint<F> where
F: Send,
impl<F> Sync for CauchyPoint<F> where
F: Sync,
impl<F> Unpin for CauchyPoint<F> where
F: Unpin,
impl<F> UnwindSafe for CauchyPoint<F> where
F: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcepub fn borrow_mut(&mut self) -> &mut T
pub fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<T> ToOwned for T where
T: Clone,
impl<T> ToOwned for T where
T: Clone,
type Owned = T
type Owned = T
The resulting type after obtaining ownership.
sourcepub fn to_owned(&self) -> T
pub fn to_owned(&self) -> T
Creates owned data from borrowed data, usually by cloning. Read more
sourcepub fn clone_into(&self, target: &mut T)
pub fn clone_into(&self, target: &mut T)
toowned_clone_into
)Uses borrowed data to replace owned data, usually by cloning. Read more