Hanke-Raus heuristic rule for iteratively regularized stochastic gradient descent
From MaRDI portal
Cites work
- A convergence analysis of the Landweber iteration for nonlinear ill-posed problems
- A data-dependent regularization method based on the graph Laplacian
- A General Heuristic for Choosing the Regularization Parameter in Ill-Posed Problems
- A modified Landweber iteration for solving parameter estimation problems
- A novel two-point Landweber-type method for regularization of non-smooth inverse problems in Banach spaces
- A numerical comparison of some heuristic stopping rules for nonlinear Landweber iteration
- A Stochastic Approximation Method
- An introduction to the mathematical theory of inverse problems
- Bouligand-Landweber iteration for a non-smooth ill-posed problem
- Bouligand-Levenberg-Marquardt iteration for a non-smooth ill-posed inverse problem
- Computational Methods for Inverse Problems
- Convergence analysis of iteratively regularized Landweber iteration with uniformly convex constraints in Banach spaces
- Discrete inverse problems. Insight and algorithms.
- Hanke-Raus heuristic rule for variational regularization in Banach spaces
- Hanke-Raus rule for Landweber iteration in Banach spaces
- Heuristic rule for non-stationary iterated Tikhonov regularization in Banach spaces
- scientific article; zbMATH DE number 5018132 (Why is no real title available?)
- scientific article; zbMATH DE number 3298300 (Why is no real title available?)
- Inverse Problem Theory and Methods for Model Parameter Estimation
- Iterative regularization methods for nonlinear ill-posed problems
- Kaczmarz methods for regularizing nonlinear ill-posed equations. II: Applications
- Noise Level Free Regularization of General Linear Inverse Problems under Unconstrained White Noise
- Nonstationary iterated Tikhonov regularization: convergence analysis via Hölder stability
- On a heuristic stopping rule for the regularization of inverse problems by the augmented Lagrangian method
- On early stopping of stochastic mirror descent method for ill-posed inverse problems
- On projective stochastic-gradient type methods for solving large scale systems of nonlinear ill-posed equations: applications to machine learning
- On the Convergence of Stochastic Gradient Descent for Nonlinear Ill-Posed Problems
- On the convergence of the iterative regularization method assisted by the graph Laplacian with early stopping
- On the discrepancy principle for stochastic gradient descent
- On the regularizing property of stochastic gradient descent
- Remarks on choosing a regularization parameter using the quasi-optimality and ratio criterion
- Stochastic data-driven Bouligand-Landweber method for solving non-smooth inverse problems
- Stochastic gradient descent for linear inverse problems in Hilbert spaces
- Stochastic gradient descent method with convex penalty for ill-posed problems in Banach spaces
- Stochastic linear regularization methods: random discrepancy principle and applications
- Stochastic mirror descent method for linear ill-posed problems in Banach spaces
- The mathematics of computerized tomography
This page was built for publication: Hanke-Raus heuristic rule for iteratively regularized stochastic gradient descent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7295396)