Biconvex optimization
id:
biconvex-optimization-241-7370281
title:
Biconvex optimization
text:
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 ⊂ X × Y is called a biconvex set on X × Y if for every fixed y ∈ Y , B y = { x ∈ X : ∈ B } is a convex set in X and for every fixed x ∈ X , B x = { y ∈ Y : ∈ B } is a convex set in Y . A function f : B → R is called a biconvex function if fixing x , f x = f is convex over Y and fixing y
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Biconvex_optimization
date created:
date modified:
2023-07-05T18:03:20Z
main entity:
{"identifier":"Q17003174","url":"https://www.wikidata.org/entity/Q17003174"}
image:
fields total:
13
integrity:
13