Iterative parameter choice by discrepancy principle

DOI10.1093/imanum/drr051zbMath1261.65052OpenAlexW2319574734MaRDI QIDQ4649642

Bangti Jin, Jun Zou, Yu-Bo Zhao

Publication date: 12 November 2012

Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imanum/drr051

zbMATH Keywords

algorithmsnumerical experimentsTikhonov regularizationdiscrepancy principleregularization parameterlinear inverse problemsmodel function approach

Mathematics Subject Classification ID

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) Numerical solution to inverse problems in abstract spaces (65J22)

Related Items (5)

Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares ⋮ Morozov's discrepancy principle for \(\alpha\ell_1-\beta\ell_2\) sparsity regularization ⋮ An inner-outer regularizing method for ill-posed problems ⋮ Two efficient algorithms for surface construction ⋮ Risk estimators for choosing regularization parameters in ill-posed problems -- properties and limitations

This page was built for publication: Iterative parameter choice by discrepancy principle