# Struct argmin::solver::landweber::Landweber[−][src]

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

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

Constructor

## Trait Implementations

### `impl<F: Clone> Clone for Landweber<F>`[src]

#### `fn clone(&self) -> Landweber<F>`[src]

Returns a copy of the value. Read more

#### `fn clone_from(&mut self, source: &Self)`1.0.0[src]

Performs copy-assignment from `source`. Read more

### `impl<'de, F> Deserialize<'de> for Landweber<F> where    F: Deserialize<'de>, `[src]

#### `fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where    __D: Deserializer<'de>, `[src]

Deserialize this value from the given Serde deserializer. Read more

### `impl<F> Serialize for Landweber<F> where    F: Serialize, `[src]

#### `fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where    __S: Serializer, `[src]

Serialize this value into the given Serde serializer. Read more

### `impl<O, F> Solver<O> for Landweber<F> where    O: ArgminOp<Float = F>,    O::Param: ArgminScaledSub<O::Param, O::Float, O::Param>,    F: ArgminFloat, `[src]

#### `const NAME: &'static str`[src]

Name of the solver

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

Computes one iteration of the algorithm.

#### `fn terminate_internal(&mut self, state: &IterState<O>) -> TerminationReason`[src]

Checks whether basic termination reasons apply. Read more

#### `fn terminate(&mut self, _state: &IterState<O>) -> TerminationReason`[src]

Checks whether the algorithm must be terminated

## Blanket Implementations

### `impl<T> Any for T where    T: 'static + ?Sized, `[src]

#### `pub fn type_id(&self) -> TypeId`[src]

Gets the `TypeId` of `self`. Read more

### `impl<T> Borrow<T> for T where    T: ?Sized, `[src]

#### `pub fn borrow(&self) -> &T`[src]

Immutably borrows from an owned value. Read more

### `impl<T> BorrowMut<T> for T where    T: ?Sized, `[src]

#### `pub fn borrow_mut(&mut self) -> &mut T`[src]

Mutably borrows from an owned value. Read more

### `impl<T> From<T> for T`[src]

#### `pub fn from(t: T) -> T`[src]

Performs the conversion.

### `impl<T, U> Into<U> for T where    U: From<T>, `[src]

#### `pub fn into(self) -> U`[src]

Performs the conversion.

### `impl<T> ToOwned for T where    T: Clone, `[src]

#### `type Owned = T`

The resulting type after obtaining ownership.

#### `pub fn to_owned(&self) -> T`[src]

Creates owned data from borrowed data, usually by cloning. Read more

#### `pub fn clone_into(&self, target: &mut T)`[src]

🔬 This is a nightly-only experimental API. (`toowned_clone_into`)

Uses borrowed data to replace owned data, usually by cloning. Read more

### `impl<T, U> TryFrom<U> for T where    U: Into<T>, `[src]

#### `type Error = Infallible`

The type returned in the event of a conversion error.

#### `pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>`[src]

Performs the conversion.

### `impl<T, U> TryInto<U> for T where    U: TryFrom<T>, `[src]

#### `type Error = <U as TryFrom<T>>::Error`

The type returned in the event of a conversion error.

#### `pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>`[src]

Performs the conversion.