Roger Hendrickx

]]>R.L.L Hendrickx ]]>

“There is an ongoing debate if it is reasonable to assume that the noise level is known – my experience when working with engineers is that they are usually very good in quantifying the noise present in their system and hence, in my view the assumption that noise level is known is ok.”

How about we really do not know the noise level. Is there a way to still use Morozov principle to choose the regularization parameter ? Can you point out some papers or articles in this direction ?

]]>Auf Seite 17, zweiter Absatz (gleich unter der Formel) sollte es glaube ich heißen, dass f eine Funktion auf einer Teilmenge G des R^(n+1) definiert ist, nicht R^n.

Liebe Grüße ]]>

In fact, the alternating algorithms is just a coordinate descent method applied to the convex function of u and v. But it is unclear how one can interpret simultaneous update of this particular problem from the optimization point of view. Anyway you are right, even if it converges, its speed of convergence is slower.

Sorry, it seems, I do not know how to write math formulas here.

]]>\begin{align}

u^{n+1} & = \frac{p}{Mv^n}\\

v^{n+1} &= \frac{q}{M^T u^{n+1}}

\end{align} ]]>