On a heuristic stopping rule for the regularization of inverse problems by the augmented Lagrangian method
DOI10.1007/s00211-016-0860-8zbMath1376.65086OpenAlexW2562805810MaRDI QIDQ2407467
Publication date: 29 September 2017
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00211-016-0860-8
error estimateslinear integral equationiterative regularizationdiscrepancy principleaugmented Lagrangian methodnumerical resultparameter choiceHanke-Raus ruleconvex penalty
Numerical methods for integral equations (65R20) Numerical solutions to equations with linear operators (65J10) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Linear operators and ill-posed problems, regularization (47A52) Linear integral equations (45A05) Numerical solution to inverse problems in abstract spaces (65J22)
Related Items (12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Regularization methods in Banach spaces.
- Regularization of ill-posed linear equations by the non-stationary augmented Lagrangian method
- On the convergence of the quasioptimality criterion for (iterated) Tikhonov regularization
- Nonstationary iterated Tikhonov regularization in Banach spaces with uniformly convex penalty terms
- Multiplier and gradient methods
- Hanke-Raus heuristic rule for variational regularization in Banach spaces
- Morozov’s Principle for the Augmented Lagrangian Method Applied to Linear Inverse Problems
- Regularization of linear ill-posed problems by the augmented Lagrangian method and variational inequalities
- Nonstationary iterated Tikhonov regularization for ill-posed problems in Banach spaces
- Lagrange Multiplier Approach to Variational Problems and Applications
- Remarks on choosing a regularization parameter using the quasi-optimality and ratio criterion
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Practical Approximate Solutions to Linear Operator Equations When the Data are Noisy
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- A General Heuristic for Choosing the Regularization Parameter in Ill-Posed Problems
- A convergence rates result for Tikhonov regularization in Banach spaces with non-smooth operators
- Heuristic Parameter-Choice Rules for Convex Variational Regularization Based on Error Estimates
This page was built for publication: On a heuristic stopping rule for the regularization of inverse problems by the augmented Lagrangian method