{
  "id": "1102.1347",
  "version": "v1",
  "published": "2011-02-07T16:09:10.000Z",
  "updated": "2011-02-07T16:09:10.000Z",
  "title": "Universal derivative-free optimization method with quadratic convergence",
  "authors": [
    "Sergey Moiseev"
  ],
  "comment": "23 pages, 11 figures, 3 tables",
  "categories": [
    "math.OC"
  ],
  "abstract": "A new universal derivative-free optimization method CDOS (Conjugate Direction with Orthogonal Shift) is proposed. The CDOS method was specially developed to solve optimization tasks where the objective function and constraints are black boxes. The method has quadratic convergence for quadratic and near quadratic functions. An objective function can be non-differentiable and non-continuous. For constrained optimization the constraints can also be non-differentiable and non-continuous. The method handles inequality constraints directly, i.e., it does not transform the objective function, nor uses numeric values of the inequality constraints - it uses only the fact of constraint violation.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2011-02-07T16:09:10.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "90C30",
      "90C56",
      "90C11",
      "90C26"
    ],
    "keywords": [
      "quadratic convergence",
      "objective function",
      "universal derivative-free optimization method cdos",
      "method handles inequality constraints"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 23,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2011arXiv1102.1347M"
    }
  }
}