Iterant recombination with one-norm minimization for multilevel Markov chain algorithms via the ellipsoid method

Hans De Sterck, Killian Miller, Geoffrey Sanders. Iterant recombination with one-norm minimization for multilevel Markov chain algorithms via the ellipsoid method. Computat. and Visualiz. in Science, 14(2):51-65, 2011. [doi]

@article{SterckMS11,
  title = {Iterant recombination with one-norm minimization for multilevel Markov chain algorithms via the ellipsoid method},
  author = {Hans De Sterck and Killian Miller and Geoffrey Sanders},
  year = {2011},
  doi = {10.1007/s00791-011-0163-7},
  url = {http://dx.doi.org/10.1007/s00791-011-0163-7},
  researchr = {https://researchr.org/publication/SterckMS11},
  cites = {0},
  citedby = {0},
  journal = {Computat. and Visualiz. in Science},
  volume = {14},
  number = {2},
  pages = {51-65},
}