Struct argmin::solver::landweber::Landweber

pub struct Landweber<F> { /* fields omitted */ }

The Landweber iteration is a solver for ill-posed linear inverse problems.

In iteration k, the new parameter vector x_{k+1} is calculated from the previous parameter vector x_k and the gradient at x_k according to the following update rule:

x_{k+1} = x_k - omega * \nabla f(x_k)

Example

References

[0] Landweber, L. (1951): An iteration formula for Fredholm integral equations of the first kind. Amer. J. Math. 73, 615–624 [1] https://en.wikipedia.org/wiki/Landweber_iteration

Implementations

impl<F> Landweber<F>

pub fn new(omega: F) -> Self

Constructor

Trait Implementations

impl<F: Clone> Clone for Landweber<F>

fn clone(&self) -> Landweber<F>

Returns a copy of the value.

pub fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<'de, F> Deserialize<'de> for Landweber<F> where
    F: Deserialize<'de>, 

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

Deserialize this value from the given Serde deserializer.

impl<F> Serialize for Landweber<F> where
    F: Serialize, 

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

Serialize this value into the given Serde serializer.

impl<O, F> Solver<O> for Landweber<F> where
    O: ArgminOp<Float = F>,
    O::Param: ArgminScaledSub<O::Param, O::Float, O::Param>,
    F: ArgminFloat, 

const NAME: &'static str

Name of the solver

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

Computes one iteration of the algorithm.

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

Initializes the algorithm

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

Checks whether basic termination reasons apply.

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

Checks whether the algorithm must be terminated