{
  "id": "1508.04468",
  "version": "v1",
  "published": "2015-08-18T21:56:08.000Z",
  "updated": "2015-08-18T21:56:08.000Z",
  "title": "Linear Convergence of the ADMM/Douglas-Rachford Algorithms for Piecewise Linear-Quadratic Functions and Application to Statistical Imaging",
  "authors": [
    "Timo Aspelmeier",
    "C. Charitha",
    "D. Russell Luke"
  ],
  "comment": "26 pages including 6 figures, one appendix and 46 references",
  "categories": [
    "math.OC",
    "math.NA"
  ],
  "abstract": "We consider the problem of minimizing the sum of a convex, piecewise linear- quadratic function and a convex piecewise linear-quadratic function composed with an injective linear mapping. We show that, for such problems, iterates of the alternating directions method of multipliers converge linearly to fixed points from which the solution to the original problem can be computed. Our proof strategy uses duality and strong metric subregularity of the Douglas-Rachford fixed point mapping. Our analysis does not require strong convexity and yields error bounds to the set of model solutions. We demonstrate an application of this result to exact penalization for signal deconvolution and denoising with multiresolution statistical constraints.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-08-18T21:56:08.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "49J52",
      "49M20",
      "90C26"
    ],
    "keywords": [
      "linear convergence",
      "admm/douglas-rachford algorithms",
      "statistical imaging",
      "application",
      "convex piecewise linear-quadratic function"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 26,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}