{
  "id": "enwiki-001163597521",
  "slug": "biconvex-optimization",
  "title": "Biconvex optimization",
  "qid": "",
  "lead": "Biconvex optimization is a generalization of convex optimization where the objective function and the constraint set can be biconvex. There are methods that can find the global optimum of these problems. A set B \\subset X\\times Y is called a biconvex set on X\\times Y if for every fixed y\\in Y , B_y = \\{x \\in X: (x,y) \\in B\\} is a convex set in X and for every fixed x\\in X , B_x = \\{y \\in Y: (x,y) \\in B\\} is a convex set in Y . A function f(x, y): B \\to \\mathbb{R} is called a biconvex function if fixing x , f_x(y) = f(x, y) is convex over Y and fixing y , f_y(x) = f(x, y) is convex over X . A common practice for solving a biconvex problem (which does not guarantee global optimality of the solution) is alternatively updating x, y by fixing one of them and solving the corresponding convex optimization problem. The generalization to functions of more than two arguments is called a block multi-convex function. A function f(x_1,\\ldots,x_K) \\to \\mathbb{R} is block multi-convex iff it is convex with respect to each of the individual arguments while holding all others fixed.",
  "body": "Biconvex optimization is a generalization of convex optimization where the objective function and the constraint set can be biconvex. There are methods that can find the global optimum of these problems. A set B \\subset X\\times Y is called a biconvex set on X\\times Y if for every fixed y\\in Y , B_y = \\{x \\in X: (x,y) \\in B\\} is a convex set in X and for every fixed x\\in X , B_x = \\{y \\in Y: (x,y) \\in B\\} is a convex set in Y . A function f(x, y): B \\to \\mathbb{R} is called a biconvex function if fixing x , f_x(y) = f(x, y) is convex over Y and fixing y , f_y(x) = f(x, y) is convex over X . A common practice for solving a biconvex problem (which does not guarantee global optimality of the solution) is alternatively updating x, y by fixing one of them and solving the corresponding convex optimization problem. The generalization to functions of more than two arguments is called a block multi-convex function. A function f(x_1,\\ldots,x_K) \\to \\mathbb{R} is block multi-convex iff it is convex with respect to each of the individual arguments while holding all others fixed.",
  "categories": [
    "20476732",
    "20476824",
    "20476827",
    "23468805"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1163597521",
  "content_hash": "",
  "created_at": null,
  "updated_at": 1688573000.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "enwiki-001163597521",
    "type": "webpage",
    "title": "Biconvex optimization",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/biconvex-optimization",
    "issued": {
      "date-parts": [
        [
          2026,
          11,
          22
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          22
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:enwiki-001163597521",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1163597521",
    "note": "Immutable snapshot enwiki-001163597521"
  }
}