Two linearized block coordinate descent algorithms for nonsmooth composite optimization converge in expectation to a stationary point at O(1/ε²) rate.
Relaxed Gauss-Newton methods with applications to electrical impedance tomography
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
As second-order methods, Gauss--Newton-type methods can be more effective than first-order methods for the solution of nonsmooth optimization problems with expensive-to-evaluate smooth components. Such methods, however, often do not converge. Motivated by nonlinear inverse problems with nonsmooth regularization, we propose a new Gauss--Newton-type method with inexact relaxed steps. We prove that the method converges to a set of disjoint critical points given that the linearisation of the forward operator for the inverse problem is sufficiently precise. We extensively evaluate the performance of the method on electrical impedance tomography (EIT).
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems
Two linearized block coordinate descent algorithms for nonsmooth composite optimization converge in expectation to a stationary point at O(1/ε²) rate.