A linear-time algorithm to compute the conjugate of convex piecewise linear-quadratic bivariate functions. Haque, Tasnuva; Lucet, Yves
We propose the first algorithm to compute the conjugate of a bivariate Piecewise Linear-Quadratic (PLQ) function in optimal linear worst-case time complexity. The key step is to use a planar graph, called the entity graph, not only to represent the entities (vertex, edge, or face) of the domain of a PLQ function but most importantly to record adjacent entities. We traverse the graph using breadth-first search to compute the conjugate of each entity using graph-matrix calculus, and use the adjacency information to create the output data structure in linear time.
Item Citations and Data
Attribution-NonCommercial-NoDerivatives 4.0 International