Struct argmin::solver::trustregion::trustregion_method::TrustRegion

pub struct TrustRegion<R> { /* fields omitted */ }

The trust region method approximates the cost function within a certain region around the current point in parameter space. Depending on the quality of this approximation, the region is either expanded or contracted.

The calculation of the actual step length and direction is done by one of the following methods:

• Cauchy point
• Dogleg method
• Steihaug method

This subproblem can be set via set_subproblem(...). If this is not provided, it will default to the Steihaug method.

Example

References:

[0] Jorge Nocedal and Stephen J. Wright (2006). Numerical Optimization. Springer. ISBN 0-387-30303-0.

Methods

impl<R> TrustRegion<R>

pub fn new(subproblem: R) -> Self

Constructor

pub fn radius(self, radius: f64) -> Self

set radius

pub fn max_radius(self, max_radius: f64) -> Self

Set maximum radius

pub fn eta(self, eta: f64) -> Result<Self, Error>

Set eta

Trait Implementations

impl<R> Serialize for TrustRegion<R> where
    R: Serialize, 

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where
    __S: Serializer, 

Serialize this value into the given Serde serializer.

impl<'de, R> Deserialize<'de> for TrustRegion<R> where
    R: Deserialize<'de>, 

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl<O, R> Solver<O> for TrustRegion<R> where
    O: ArgminOp<Output = f64>,
    O::Param: Default + Clone + Debug + Serialize + ArgminMul<f64, O::Param> + ArgminWeightedDot<O::Param, f64, O::Hessian> + ArgminNorm<f64> + ArgminDot<O::Param, f64> + ArgminAdd<O::Param, O::Param> + ArgminSub<O::Param, O::Param> + ArgminZeroLike + ArgminMul<f64, O::Param>,
    O::Hessian: Default + Clone + Debug + Serialize + ArgminDot<O::Param, O::Param>,
    R: ArgminTrustRegion + Solver<OpWrapper<O>>, 

const NAME: &'static str

fn init(
    &mut self,
    op: &mut OpWrapper<O>,
    state: &IterState<O>
) -> Result<Option<ArgminIterData<O>>, Error>

Initializes the algorithm

fn next_iter(
    &mut self,
    op: &mut OpWrapper<O>,
    state: &IterState<O>
) -> Result<ArgminIterData<O>, Error>

Computes one iteration of the algorithm.

fn terminate(&mut self, _state: &IterState<O>) -> TerminationReason

Checks whether the algorithm must be terminated

fn terminate_internal(&mut self, state: &IterState<O>) -> TerminationReason

Checks whether basic termination reasons apply.