{
  "id": "1909.01397",
  "version": "v1",
  "published": "2019-09-03T18:50:12.000Z",
  "updated": "2019-09-03T18:50:12.000Z",
  "title": "Global Optima is not Limit Computable",
  "authors": [
    "K. Lakshmanan"
  ],
  "comment": "11 pages, 9 figures",
  "categories": [
    "math.OC"
  ],
  "abstract": "We study the limit computability of finding a global optimum of a continuous function. We give a short proof to show that the problem of checking whether a point is a global minimum is not limit computable. Thereby showing the same for the problem of finding a global minimum. In the next part, we give an algorithm that converges to the global minima when a lower bound on the size of the basin of attraction of the global minima is known. We prove the convergence of this algorithm and provide some numerical experiments.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2019-09-03T18:50:12.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "global optimum",
      "limit computable",
      "global minimum",
      "lower bound",
      "limit computability"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 11,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}