{
  "id": "1707.08655",
  "version": "v1",
  "published": "2017-07-26T22:18:57.000Z",
  "updated": "2017-07-26T22:18:57.000Z",
  "title": "On the complexity of the projective splitting and Spingarn's methods for the sum of two maximal monotone operators",
  "authors": [
    "Majela Pentón Machado"
  ],
  "categories": [
    "math.OC"
  ],
  "abstract": "In this work we study the pointwise and ergodic iteration-complexity of a family of projective splitting methods proposed by Eckstein and Svaiter, for finding a zero of the sum of two maximal monotone operators. As a consequence of the complexity analysis of the projective splitting methods, we obtain complexity bounds for the two-operator case of Spingarn's partial inverse method. We also present inexact variants of two specific instances of this family of algorithms, and derive corresponding convergence rate results.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2017-07-26T22:18:57.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "maximal monotone operators",
      "spingarns methods",
      "corresponding convergence rate results",
      "complexity",
      "projective splitting methods"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}