{
  "annotation_id": "2878f545-d865-4b32-864a-4c1c3867a38a",
  "date_created": "2026-02-17T05:53:08.773000Z",
  "date_modified": "2026-02-17T05:53:08.773000Z",
  "file_hash": "a6add15266913e4e7dfbd1dad6835d5db32d45a474256271286b1c84c15f3474",
  "private": false,
  "record": {
    "abstract": "We consider the saddle point problem where the objective functions are abstract convex with respect to the class of quadratic functions. We propose primal-dual algorithms using the corresponding abstract proximal operator and investigate the convergence under certain restrictions. We test our algorithms by several numerical examples.",
    "arxiv_id": "2601.07076",
    "authors": [
      "Ewa Bednarczuk",
      "The Hung Tran"
    ],
    "categories": [
      "math.OC",
      "cs.NA",
      "math.NA"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "title": "Primal-Dual algorithms for Abstract convex functions with respect to quadratic functions",
    "url": "https://arxiv.org/abs/2601.07076",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "b2f3c85a-d76b-4cf2-a70c-4b93f75dd0e4",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}