A stochastic iteratively regularized Gauss-Newton method
From MaRDI portal
Recommendations
Cites work
- A convergence rates result for Tikhonov regularization in Banach spaces with non-smooth operators
- A general convergence analysis of some Newton-type methods for nonlinear inverse problems
- A regularizing Levenberg - Marquardt scheme, with applications to inverse groundwater filtration problems
- A statistical perspective on randomized sketching for ordinary least-squares
- A Stochastic Approximation Method
- A stochastic Levenberg-Marquardt method using random models with complexity results
- A variational perspective on accelerated methods in optimization
- Adaptive Tikhonov strategies for stochastic ensemble Kalman inversion
- Approximate Gauss–Newton Methods for Nonlinear Least Squares Problems
- Characterizations of variational source conditions, converse results, and maxisets of spectral regularization methods
- Convergence acceleration of ensemble Kalman inversion in nonlinear settings
- Convergence and complexity analysis of a Levenberg-Marquardt algorithm for inverse problems
- Derivative-free optimization methods
- Ensemble Kalman methods for inverse problems
- Filter based methods for statistical linear inverse problems
- scientific article; zbMATH DE number 46855 (Why is no real title available?)
- scientific article; zbMATH DE number 2146003 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Introductory lectures on convex optimization. A basic course.
- Inverse problems: a Bayesian perspective
- Iterative ensemble Kalman methods: a unified perspective with some new variants
- Iterative regularization methods for nonlinear ill-posed problems
- Iteratively Regularized Gauss–Newton Method for Nonlinear Inverse Problems with Random Noise
- Iteratively regularized Newton-type methods for general data misfit functionals and applications to Poisson data
- Levenberg-Marquardt methods based on probabilistic gradient models and inexact subproblem solution, with application to data assimilation
- On a Dynamic Variant of the Iteratively Regularized Gauss–Newton Method with Sequential Data
- On convergence rates for iteratively regularized Newton-type methods under a Lipschitz-type nonlinearity condition
- On convergence rates for the iteratively regularized Gauss-newton method
- On the iteratively regularized Gauss-Newton method for solving nonlinear ill-posed problems
- Optimization methods for large-scale machine learning
- Parameterizations for ensemble Kalman inversion
- Randomized iterative methods for linear systems
- Regularization theory for ill-posed problems. Selected topics
- Stochastic reformulations of linear systems: algorithms and convergence theory
- The Iterated Kalman Smoother as a Gauss–Newton Method
- The Lepskii principle revisited
- The problem of the convergence of the iteratively regularized Gauss- Newton method
Cited in
(2)
This page was built for publication: A stochastic iteratively regularized Gauss-Newton method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659675)
