<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">445862041</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180317145446.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170323e20110301xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s10092-010-0030-9</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s10092-010-0030-9</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="2">
   <subfield code="a">A hybrid multilevel-active set method for large box-constrained linear discrete ill-posed problems</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[S. Morigi, R. Plemmons, L. Reichel, F. Sgallari]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Many questions in science and engineering give rise to linear ill-posed problems, whose solution is known to satisfy box constraints, such as nonnegativity. The solution of discretized versions of these problems is highly sensitive to perturbations in the data, discretization errors, and round-off errors introduced during the computations. It is therefore often beneficial to impose known constraints during the solution process. This paper describes a two-phase algorithm for the solution of large-scale box-constrained linear discrete ill-posed problems. The first phase applies a cascadic multilevel method and imposes the constraints on each level by orthogonal projection. The second phase improves the computed approximate solution on the finest level by an active set method. The latter allows several indices of the active set to be updated simultaneously. This reduces the computational effort significantly, when compared to standard active set methods that update one index at a time. Applications to image restoration are presented.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer-Verlag, 2010</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Constrained ill-posed problems</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Nonnegativity</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Active set method</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Multilevel method</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Image restoration</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Morigi</subfield>
   <subfield code="D">S.</subfield>
   <subfield code="u">Department of Mathematics-CIRAM, University of Bologna, Piazza Porta S. Donato 5, 40126, Bologna, Italy</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Plemmons</subfield>
   <subfield code="D">R.</subfield>
   <subfield code="u">Departments of Mathematics and Computer Science, Wake Forest University, 27106, Winston Salem, NC, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Reichel</subfield>
   <subfield code="D">L.</subfield>
   <subfield code="u">Department of Mathematical Sciences, Kent State University, 44242, Kent, OH, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Sgallari</subfield>
   <subfield code="D">F.</subfield>
   <subfield code="u">Department of Mathematics-CIRAM, University of Bologna, Via Saragozza 8, 40123, Bologna, Italy</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Calcolo</subfield>
   <subfield code="d">Springer Milan</subfield>
   <subfield code="g">48/1(2011-03-01), 89-105</subfield>
   <subfield code="x">0008-0624</subfield>
   <subfield code="q">48:1&lt;89</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">48</subfield>
   <subfield code="o">10092</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s10092-010-0030-9</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s10092-010-0030-9</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Morigi</subfield>
   <subfield code="D">S.</subfield>
   <subfield code="u">Department of Mathematics-CIRAM, University of Bologna, Piazza Porta S. Donato 5, 40126, Bologna, Italy</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Plemmons</subfield>
   <subfield code="D">R.</subfield>
   <subfield code="u">Departments of Mathematics and Computer Science, Wake Forest University, 27106, Winston Salem, NC, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Reichel</subfield>
   <subfield code="D">L.</subfield>
   <subfield code="u">Department of Mathematical Sciences, Kent State University, 44242, Kent, OH, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Sgallari</subfield>
   <subfield code="D">F.</subfield>
   <subfield code="u">Department of Mathematics-CIRAM, University of Bologna, Via Saragozza 8, 40123, Bologna, Italy</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Calcolo</subfield>
   <subfield code="d">Springer Milan</subfield>
   <subfield code="g">48/1(2011-03-01), 89-105</subfield>
   <subfield code="x">0008-0624</subfield>
   <subfield code="q">48:1&lt;89</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">48</subfield>
   <subfield code="o">10092</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
