194 citations · 286 across the 4 of their papers we have counts for
5 papers · 1 filter
Towards the Biconjugate of Bivariate Piecewise Quadratic Functions
Deepak Kumar, Yves Lucet
Computing the closed convex envelope or biconjugate is the core operation that bridges the domain of nonconvex with convex analysis. We focus here on computing the conjugate of a b…
Computation of the Epsilon-Subdifferential of Convex Piecewise-Defined Functions in Optimal Worst-Case Time
Deepak Kumar, Yves Lucet
The -subdifferential of convex univariate piecewise linear-quadratic functions can be computed in linear worst-case time complexity as the level-set of a convex function. Using…
Best practices for comparing optimization algorithms
Vahid Beiranvand, Warren Hare, Yves Lucet
Comparing, or benchmarking, of optimization algorithms is a complicated task that involves many subtle considerations to yield a fair and unbiased evaluation. In this paper, we sys…
Visualization of the ε-Subdifferential of Piecewise Linear-Quadratic Functions
Anuj Bajaj, Warren Hare, Yves Lucet
Computing explicitly the ε-subdifferential of a proper function amounts to computing the level set of a convex function namely the conjugate minus a linear function. The resulting…
Optimizing horizontal alignment of roads in a specified corridor
Sukanto Mondal, Yves Lucet, Warren Hare
Finding an optimal alignment connecting two end-points in a specified corridor is a complex problem that requires solving three interrelated sub-problems, namely the horizontal ali…