@article{BlanchardMathe2012,
  author    = {Blanchard, Gilles and Mathe, Peter},
  title     = {Discrepancy principle for statistical inverse problems with application to conjugate gradient iteration},
  series = {Inverse problems : an international journal of inverse problems, inverse methods and computerised inversion of data},
  volume    = {28},
  journal   = {Inverse problems : an international journal of inverse problems, inverse methods and computerised inversion of data},
  number    = {11},
  publisher = {IOP Publ. Ltd.},
  address   = {Bristol},
  issn      = {0266-5611},
  doi       = {10.1088/0266-5611/28/11/115011},
  pages     = {23},
  year      = {2012},
  abstract  = {The authors discuss the use of the discrepancy principle for statistical inverse problems, when the underlying operator is of trace class. Under this assumption the discrepancy principle is well defined, however a plain use of it may occasionally fail and it will yield sub-optimal rates. Therefore, a modification of the discrepancy is introduced, which corrects both of the above deficiencies. For a variety of linear regularization schemes as well as for conjugate gradient iteration it is shown to yield order optimal a priori error bounds under general smoothness assumptions. A posteriori error control is also possible, however at a sub-optimal rate, in general. This study uses and complements previous results for bounded deterministic noise.},
  language  = {en}
}
@unpublished{BlanchardMathe2012,
  author    = {Blanchard, Gilles and Math{\´e}, Peter},
  title     = {Discrepancy principle for statistical inverse problems with application to conjugate gradient iteration},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-57117},
  year      = {2012},
  abstract  = {The authors discuss the use of the discrepancy principle for statistical inverse problems, when the underlying operator is of trace class. Under this assumption the discrepancy principle is well defined, however a plain use of it may occasionally fail and it will yield sub-optimal rates. Therefore, a modification of the discrepancy is introduced, which takes into account both of the above deficiencies. For a variety of linear regularization schemes as well as for conjugate gradient iteration this modification is shown to yield order optimal a priori error bounds under general smoothness assumptions. A posteriori error control is also possible, however at a sub-optimal rate, in general. This study uses and complements previous results for bounded deterministic noise.},
  language  = {en}
}