pub struct Dogleg<F> { /* private fields */ }
Expand description
The Dogleg method computes the intersection of the trust region boundary with a path given by the unconstraind minimum along the steepest descent direction and the optimum of the quadratic approximation of the cost function at the current point.
§References:
[0] Jorge Nocedal and Stephen J. Wright (2006). Numerical Optimization. Springer. ISBN 0-387-30303-0.
Implementations§
Trait Implementations§
Source§impl<F: ArgminFloat> ArgminTrustRegion<F> for Dogleg<F>
impl<F: ArgminFloat> ArgminTrustRegion<F> for Dogleg<F>
Source§fn set_radius(&mut self, radius: F)
fn set_radius(&mut self, radius: F)
Set the initial step length
Source§impl<'de, F> Deserialize<'de> for Dogleg<F>where
F: Deserialize<'de>,
impl<'de, F> Deserialize<'de> for Dogleg<F>where
F: Deserialize<'de>,
Source§fn 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
Source§impl<F: PartialOrd> PartialOrd for Dogleg<F>
impl<F: PartialOrd> PartialOrd for Dogleg<F>
Source§impl<O, F> Solver<O> for Dogleg<F>where
O: ArgminOp<Output = F, Float = F>,
O::Param: Debug + ArgminMul<F, O::Param> + ArgminWeightedDot<O::Param, O::Float, O::Hessian> + ArgminNorm<F> + ArgminDot<O::Param, O::Float> + ArgminAdd<O::Param, O::Param> + ArgminSub<O::Param, O::Param>,
O::Hessian: ArgminInv<O::Hessian> + ArgminDot<O::Param, O::Param>,
F: ArgminFloat,
impl<O, F> Solver<O> for Dogleg<F>where
O: ArgminOp<Output = F, Float = F>,
O::Param: Debug + ArgminMul<F, O::Param> + ArgminWeightedDot<O::Param, O::Float, O::Hessian> + ArgminNorm<F> + ArgminDot<O::Param, O::Float> + ArgminAdd<O::Param, O::Param> + ArgminSub<O::Param, O::Param>,
O::Hessian: ArgminInv<O::Hessian> + ArgminDot<O::Param, O::Param>,
F: ArgminFloat,
Source§fn 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.
Source§fn terminate(&mut self, state: &IterState<O>) -> TerminationReason
fn terminate(&mut self, state: &IterState<O>) -> TerminationReason
Checks whether the algorithm must be terminated
Source§fn 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
Source§fn 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 Dogleg<F>
impl<F> StructuralPartialEq for Dogleg<F>
Auto Trait Implementations§
impl<F> Freeze for Dogleg<F>where
F: Freeze,
impl<F> RefUnwindSafe for Dogleg<F>where
F: RefUnwindSafe,
impl<F> Send for Dogleg<F>where
F: Send,
impl<F> Sync for Dogleg<F>where
F: Sync,
impl<F> Unpin for Dogleg<F>where
F: Unpin,
impl<F> UnwindSafe for Dogleg<F>where
F: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more