{
  "id": "0804.3647",
  "version": "v1",
  "published": "2008-04-23T06:48:05.000Z",
  "updated": "2008-04-23T06:48:05.000Z",
  "title": "On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces",
  "authors": [
    "Dan Butnariu",
    "Yair Censor",
    "Pini Gurfil",
    "Ethan Hadar"
  ],
  "comment": "SIAM Journal on Optimization, accepted for publication",
  "journal": "SIAM Journal on Optimization 19: 786--807, (2008)",
  "categories": [
    "math.OC",
    "math.NA"
  ],
  "abstract": "We study some methods of subgradient projections for solving a convex feasibility problem with general (not necessarily hyperplanes or half-spaces) convex sets in the inconsistent case and propose a strategy that controls the relaxation parameters in a specific self-adapting manner. This strategy leaves enough user-flexibility but gives a mathematical guarantee for the algorithm's behavior in the inconsistent case. We present numerical results of computational experiments that illustrate the computational advantage of the new method.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2008-04-23T06:48:05.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "49M20"
    ],
    "keywords": [
      "convex feasibility problem",
      "subgradient projections methods",
      "euclidean spaces",
      "inconsistent case",
      "relaxation parameters"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2008arXiv0804.3647B"
    }
  }
}