Biconvex optimization

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

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.

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.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1163597521 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001163597521 · captured 1688573000.0 · version history

Cite this page as: encyclopegia.org, “Biconvex optimization”, snapshot enwiki-001163597521. https://encyclopegia.org/a/biconvex-optimization

Sources cited in this revision

2 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.