Struct argmin_core::ArgminBase

pub struct ArgminBase<'a, T, U, H> { /* private fields */ }

Storage for data needed by most solvers

TODO: cur_cost, best_cost and target_cost should be U, but then initialization is difficult as it cannot be expected that each U has something like INFINITY and NEG_INFINITY…

Implementations

impl<'a, T, U, H> ArgminBase<'a, T, U, H>where
    T: Clone + Default,
    H: Clone + Default,

pub fn new(
    operator: &'a dyn ArgminOperator<Parameters = T, OperatorOutput = U, Hessian = H>,
    param: T
) -> Self

Constructor

pub fn kv_for_logs(&self) -> ArgminKV

Return the KV for the initial logging

pub fn kv_for_iter(&self) -> ArgminKV

Return the KV for logging of the iterations

pub fn reset(&mut self)

Reset self to its initial state.

This is dangerous the way it is implemented right now. This has to be done better. For instance, all old data needs to be kept in order to be able to actually go back to the initial state. Also, this method definitely needs to be kept up to date otherwise nasty bugs may happen.

pub fn apply(&mut self, param: &T) -> Result<U, Error>

Apply the operator to param

pub fn gradient(&mut self, param: &T) -> Result<T, Error>

Compute the gradient at param

pub fn hessian(&mut self, param: &T) -> Result<H, Error>

Compute the hessian at param

pub fn modify(&self, param: &T, factor: f64) -> Result<T, Error>

Modify a param with the modify method of operator.

pub fn set_cur_param(&mut self, param: T) -> &mut Self

Set the current parameter vector

pub fn cur_param(&self) -> T

Return the current parameter vector

pub fn set_best_param(&mut self, param: T) -> &mut Self

Set the new best parameter vector

pub fn best_param(&self) -> T

Return the current best parameter vector

pub fn set_cur_cost(&mut self, cost: f64) -> &mut Self

Set the current cost function value

pub fn cur_cost(&self) -> f64

Return the current cost function value

pub fn set_best_cost(&mut self, cost: f64) -> &mut Self

Set the cost function value of the current best parameter vector

pub fn best_cost(&self) -> f64

Return the cost function value of the current best parameter vector

pub fn set_cur_grad(&mut self, grad: T) -> &mut Self

Set the current gradient

pub fn cur_grad(&self) -> T

Return the current gradient

pub fn set_cur_hessian(&mut self, hessian: H) -> &mut Self

Set the current hessian

pub fn cur_hessian(&self) -> H

Return the current hessian

pub fn set_target_cost(&mut self, cost: f64) -> &mut Self

Set the target cost function value

pub fn target_cost(&self) -> f64

Return the target cost function value

pub fn increment_iter(&mut self) -> &mut Self

Increment the number of iterations.

pub fn cur_iter(&self) -> u64

Return the current number of iterations

pub fn increment_cost_func_count(&mut self) -> &mut Self

Increment the cost function evaluation count

pub fn increase_cost_func_count(&mut self, count: u64) -> &mut Self

Increaese the cost function evaluation count by a given value

pub fn cost_func_count(&self) -> u64

Return the cost function evaluation count

pub fn increment_grad_func_count(&mut self) -> &mut Self

Increment the gradient evaluation count

pub fn increase_grad_func_count(&mut self, count: u64) -> &mut Self

Increase the gradient evaluation count by a given value

pub fn grad_func_count(&self) -> u64

Return the gradient evaluation count

pub fn increment_hessian_func_count(&mut self) -> &mut Self

Increment the hessian evaluation count

pub fn increase_hessian_func_count(&mut self, count: u64) -> &mut Self

Increase the hessian evaluation count by a given value

pub fn hessian_func_count(&self) -> u64

Return the gradient evaluation count

pub fn set_max_iters(&mut self, iters: u64) -> &mut Self

Set the maximum number of iterations.

pub fn max_iters(&self) -> u64

Return the maximum number of iterations

pub fn set_termination_reason(&mut self, reason: TerminationReason) -> &mut Self

Set the TerminationReason

pub fn termination_reason(&self) -> TerminationReason

Return the TerminationReason

pub fn termination_reason_text(&self) -> &str

Return the textual representation of the TerminationReason

pub fn terminated(&self) -> bool

Return whether the algorithm has terminated or not

pub fn result(&self) -> ArgminResult<T>

Return the result.

pub fn set_total_time(&mut self, time: Duration) -> &mut Self

Set the total time needed by the solver

pub fn total_time(&self) -> Duration

Return the total time

pub fn add_logger(&mut self, logger: Box<dyn ArgminLog>) -> &mut Self

Add a logger to the list of loggers

pub fn add_writer(
    &mut self,
    writer: Box<dyn ArgminWrite<Param = T>>
) -> &mut Self

Add a writer to the list of writers

pub fn log_iter(&self, kv: &ArgminKV) -> Result<(), Error>

Log a kv

pub fn log_info(&self, msg: &str, kv: &ArgminKV) -> Result<(), Error>

Log a message and a kv

pub fn write(&self, param: &T) -> Result<(), Error>

Write (TODO)