pub struct Landweber<F> { /* private fields */ }
Expand description
Landweber iteration
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)
Requirements on the optimization problem
The optimization problem is required to implement Gradient
.
References
Landweber, L. (1951): An iteration formula for Fredholm integral equations of the first kind. Amer. J. Math. 73, 615–624
Implementations
Trait Implementations
sourceimpl<'de, F> Deserialize<'de> for Landweber<F> where
F: Deserialize<'de>,
impl<'de, F> Deserialize<'de> for Landweber<F> where
F: Deserialize<'de>,
sourcefn 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
sourceimpl<O, F, P, G> Solver<O, IterState<P, G, (), (), F>> for Landweber<F> where
O: Gradient<Param = P, Gradient = G>,
P: Clone + ArgminScaledSub<G, F, P>,
F: ArgminFloat,
impl<O, F, P, G> Solver<O, IterState<P, G, (), (), F>> for Landweber<F> where
O: Gradient<Param = P, Gradient = G>,
P: Clone + ArgminScaledSub<G, F, P>,
F: ArgminFloat,
sourcefn next_iter(
&mut self,
problem: &mut Problem<O>,
state: IterState<P, G, (), (), F>
) -> Result<(IterState<P, G, (), (), F>, Option<KV>), Error>
fn next_iter(
&mut self,
problem: &mut Problem<O>,
state: IterState<P, G, (), (), F>
) -> Result<(IterState<P, G, (), (), F>, Option<KV>), Error>
sourcefn 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
sourcefn terminate_internal(&mut self, state: &I) -> TerminationReason
fn terminate_internal(&mut self, state: &I) -> TerminationReason
Checks whether basic termination reasons apply. Read more
sourcefn terminate(&mut self, _state: &I) -> TerminationReason
fn terminate(&mut self, _state: &I) -> TerminationReason
Used to implement stopping criteria, in particular criteria which are not covered by
(terminate_internal
. Read more
impl<F: Copy> Copy for Landweber<F>
Auto Trait Implementations
impl<F> RefUnwindSafe for Landweber<F> where
F: RefUnwindSafe,
impl<F> Send for Landweber<F> where
F: Send,
impl<F> Sync for Landweber<F> where
F: Sync,
impl<F> Unpin for Landweber<F> where
F: Unpin,
impl<F> UnwindSafe for Landweber<F> where
F: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more