pub struct CauchyPoint<F> { /* private fields */ }Expand description
§Cauchy point method
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.
§Requirements on the optimization problem
The optimization problem is required to implement Gradient and Hessian.
§Reference
Jorge Nocedal and Stephen J. Wright (2006). Numerical Optimization. Springer. ISBN 0-387-30303-0.
Implementations§
Source§impl<F> CauchyPoint<F>where
F: ArgminFloat,
impl<F> CauchyPoint<F>where
F: ArgminFloat,
Trait Implementations§
Source§impl<F: Clone> Clone for CauchyPoint<F>
impl<F: Clone> Clone for CauchyPoint<F>
Source§fn clone(&self) -> CauchyPoint<F>
fn clone(&self) -> CauchyPoint<F>
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl<F: Debug> Debug for CauchyPoint<F>
impl<F: Debug> Debug for CauchyPoint<F>
Source§impl<F: Default> Default for CauchyPoint<F>
impl<F: Default> Default for CauchyPoint<F>
Source§fn default() -> CauchyPoint<F>
fn default() -> CauchyPoint<F>
Returns the “default value” for a type. Read more
Source§impl<'de, F> Deserialize<'de> for CauchyPoint<F>where
F: Deserialize<'de>,
impl<'de, F> Deserialize<'de> for CauchyPoint<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: PartialEq> PartialEq for CauchyPoint<F>
impl<F: PartialEq> PartialEq for CauchyPoint<F>
Source§impl<F: PartialOrd> PartialOrd for CauchyPoint<F>
impl<F: PartialOrd> PartialOrd for CauchyPoint<F>
Source§impl<F> Serialize for CauchyPoint<F>where
F: Serialize,
impl<F> Serialize for CauchyPoint<F>where
F: Serialize,
Source§impl<O, F, P, G, H> Solver<O, IterState<P, G, (), H, (), F>> for CauchyPoint<F>where
O: Gradient<Param = P, Gradient = G> + Hessian<Param = P, Hessian = H>,
P: Clone + ArgminMul<F, P> + ArgminWeightedDot<P, F, H>,
G: ArgminMul<F, P> + ArgminWeightedDot<G, F, H> + ArgminL2Norm<F>,
F: ArgminFloat,
impl<O, F, P, G, H> Solver<O, IterState<P, G, (), H, (), F>> for CauchyPoint<F>where
O: Gradient<Param = P, Gradient = G> + Hessian<Param = P, Hessian = H>,
P: Clone + ArgminMul<F, P> + ArgminWeightedDot<P, F, H>,
G: ArgminMul<F, P> + ArgminWeightedDot<G, F, H> + ArgminL2Norm<F>,
F: ArgminFloat,
Source§fn next_iter(
&mut self,
problem: &mut Problem<O>,
state: IterState<P, G, (), H, (), F>,
) -> Result<(IterState<P, G, (), H, (), F>, Option<KV>), Error>
fn next_iter( &mut self, problem: &mut Problem<O>, state: IterState<P, G, (), H, (), F>, ) -> Result<(IterState<P, G, (), H, (), F>, Option<KV>), Error>
Computes a single iteration of the algorithm and has access to the optimization problem
definition and the internal state of the solver.
Returns an updated
state and optionally a KV which holds key-value pairs used in
Observers.Source§fn terminate(
&mut self,
state: &IterState<P, G, (), H, (), F>,
) -> TerminationStatus
fn terminate( &mut self, state: &IterState<P, G, (), H, (), F>, ) -> TerminationStatus
Used to implement stopping criteria, in particular criteria which are not covered by
(
terminate_internal. Read moreSource§fn init(
&mut self,
_problem: &mut Problem<O>,
state: I,
) -> Result<(I, Option<KV>), Error>
fn init( &mut self, _problem: &mut Problem<O>, state: I, ) -> Result<(I, Option<KV>), Error>
Initializes the algorithm. Read more
Source§fn terminate_internal(&mut self, state: &I) -> TerminationStatus
fn terminate_internal(&mut self, state: &I) -> TerminationStatus
Checks whether basic termination reasons apply. Read more
Source§impl<F> TrustRegionRadius<F> for CauchyPoint<F>where
F: ArgminFloat,
impl<F> TrustRegionRadius<F> for CauchyPoint<F>where
F: ArgminFloat,
Source§fn set_radius(&mut self, radius: F)
fn set_radius(&mut self, radius: F)
Set current radius.
Needed by TrustRegion.
§Example
use argmin::solver::trustregion::{CauchyPoint, TrustRegionRadius};
let mut cp: CauchyPoint<f64> = CauchyPoint::new();
cp.set_radius(0.8);impl<F: Copy> Copy for CauchyPoint<F>
impl<F: Eq> Eq for CauchyPoint<F>
impl<F> StructuralPartialEq for CauchyPoint<F>
Auto Trait Implementations§
impl<F> Freeze for CauchyPoint<F>where
F: Freeze,
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§
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