A Lepskij-type stopping rule for regularized Newton methods
DOI10.1088/0266-5611/21/6/011zbMATH Open1091.65052OpenAlexW2082143667MaRDI QIDQ3373128FDOQ3373128
Authors:
Publication date: 13 March 2006
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1088/0266-5611/21/6/011
Recommendations
- A Lepskij-type Stopping-Rule for Newton-type Methods with Random Noise
- Stopping rules for solving nonlinear ill-posed problems
- An $\epsilon $-Free a Posteriori Stopping Rule for Certain Iterative Regularization Methods
- Stopping rules for Landweber-type iteration
- A posteriori parameter choice strategies for some Newton type methods for the regularization of nonlinear ill-posed problems
convergencenumerical examplesHilbert spaceregularization methodnonlinear inverse problemlogarithmic source conditionsFréchet differentiable operatorHolder source conditionsLepskij stopping rule
Nonlinear ill-posed problems (47J06) Numerical solutions to equations with nonlinear operators (65J15) Numerical solution to inverse problems in abstract spaces (65J22)
Cited In (42)
- Adaptive minimax optimality in statistical inverse problems via SOLIT—Sharp Optimal Lepskiĭ-Inspired Tuning
- A priori stopping rule for an iterative Bregman method for optimal control problems
- Comparing parameter choice methods for regularization of ill-posed problems
- On Tikhonov regularization in Banach spaces – optimal convergence rates results
- On a Dynamic Variant of the Iteratively Regularized Gauss–Newton Method with Sequential Data
- A study of a posteriori stopping in iteratively regularized Gauss-Newton-type methods for approximating quasi-solutions of irregular operator equations
- Parameter choices for fast harmonic spline approximation
- Empirical risk minimization as parameter choice rule for general linear regularization methods
- On the quasi-optimal rules for the choice of the regularization parameter in case of a noisy operator
- On the quasioptimal regularization parameter choices for solving ill-posed problems
- Use of extrapolation in regularization methods
- Iterative Solution Methods
- Analysis of a heuristic rule for the IRGNM in Banach spaces with convex regularization terms
- An $\epsilon $-Free a Posteriori Stopping Rule for Certain Iterative Regularization Methods
- Efficient reliable image reconstruction schemes for diffuse optical tomography
- Stopping rules for Landweber-type iteration
- On universal oracle inequalities related to high-dimensional linear models
- About the balancing principle for choice of the regularization parameter
- Regularization in Banach spaces — convergence rates by approximative source conditions
- Iteratively regularized Newton-type methods for general data misfit functionals and applications to Poisson data
- A probabilistic oracle inequality and quantification of uncertainty of a modified discrepancy principle for statistical inverse problems
- The Levenberg-Marquardt regularization for the backward heat equation with fractional derivative
- A family of rules for parameter choice in Tikhonov regularization of ill-posed problems with inexact noise level
- On the discrepancy principle for some Newton type methods for solving nonlinear inverse problems
- Analysis of the iteratively regularized Gauss–Newton method under a heuristic rule
- Local solutions to inverse problems in geodesy. The impact of the noise covariance structure upon the accuracy of estimation
- Nonlinear Tikhonov regularization in Hilbert scales with balancing principle tuning parameter in statistical inverse problems
- Adaptive nonparametric instrumental variables estimation: empirical choice of the regularization parameter
- Risk hull method for spectral regularization in linear statistical inverse problems
- Risk estimators for choosing regularization parameters in ill-posed problems -- properties and limitations
- Convergence of regularization methods with filter functions for a regularization parameter chosen with GSURE and mildly ill-posed inverse problems
- A Lepskij-type Stopping-Rule for Newton-type Methods with Random Noise
- Convergence analysis of simplified Gauss–Newton iterative method under a heuristic rule
- Adaptive spectral regularizations of high dimensional linear models
- A family of preconditioned iteratively regularized methods for nonlinear minimization
- A note on logarithmic convergence rates for nonlinear Tikhonov regularization
- Adaptive estimation for some nonparametric instrumental variable models with full independence
- A parameter choice rule for Tikhonov regularization based on predictive risk
- A Newton type iterative method for heat-conduction inverse problems
- Adaptivity and oracle inequalities in linear statistical inverse problems: a (numerical) survey
- A Newton-type method for nonlinear ill-posed problems with A-smooth regularization
- Complexity estimates for severely ill-posed problems under a posteriori selection of regularization parameter
This page was built for publication: A Lepskij-type stopping rule for regularized Newton methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3373128)