{
  "id": "1401.1754",
  "version": "v1",
  "published": "2014-01-08T17:06:34.000Z",
  "updated": "2014-01-08T17:06:34.000Z",
  "title": "Greedy Strategies for Convex Optimization",
  "authors": [
    "Hao Nguyen",
    "Guergana Petrova"
  ],
  "categories": [
    "math.NA"
  ],
  "abstract": "We investigate two greedy strategies for finding an approximation to the minimum of a convex function $E$ defined on a Hilbert space $H$. We prove convergence rates for these algorithms under suitable conditions on the objective function $E$. These conditions involve the behavior of the modulus of smoothness and the modulus of uniform convexity of $E$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-01-08T17:06:34.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "greedy strategies",
      "convex optimization",
      "uniform convexity",
      "hilbert space",
      "convex function"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1401.1754N"
    }
  }
}