Convex Minimization on a Grid and Applic
β
Claudio Mirolo
π
Article
π
1998
π
Elsevier Science
π
English
β 337 KB
This article discusses a discrete version of the convex minimization problem with applications to the efficient computation of proximity measures for pairs of convex Ε½ d . polyhedra. Given a d-variate convex function and an isothetic grid of size O n in β«ήβ¬ d , which is supposed to be finite but not