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
A function
A common practice for solving a biconvex problem (which does not guarantee global optimality of the solution) is alternatively updating