Convex Minimization on a Grid and Applications
This artide discussesa discrete version of the convex minimization problem with applicationsto the efficient computation of proximity measures for pairs of convex polyhedra. Given a d-variate convex function and an isothetic grid of size O(nd) in ℝd, which is supposed to be finite but not necessaril...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Article in Journal/Newspaper |
| Language: | English |
| Published: |
1998
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/11390/679885 |