Disciplined Biconvex Programming
Disciplined Biconvex Programming (DBCP) creates a modeling framework to solve complex biconvex optimization problems, which are hard to solve directly. It extends Disciplined Convex Programming by automatically transforming these problems into simpler convex subproblems. This allows users to specify biconvex structures using simple rules, enabling the use of existing solvers via an Alternate Convex Search (ACS) heuristic.