Learning polytopes with fixed facet directions

01/10/2022
by   Maria Dostert, et al.
0

We consider the task of reconstructing polytopes with fixed facet directions from finitely many support function evaluations. We show that for fixed simplicial normal fan the least-squares estimate is given by a convex quadratic program. We study the geometry of the solution set and give a combinatorial characterization for the uniqueness of the reconstruction in this case. We provide an algorithm that, under mild assumptions, converges to the unknown input shape as the number of noisy support function evaluations increases. We also discuss limitations of our results if the restriction on the normal fan is removed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/19/2019

Extent of occurrence reconstruction using a new data-driven support estimator

Given a random sample of points from some unknown distribution, we propo...
research
02/20/2020

On the Uniqueness of Simultaneous Rational Function Reconstruction

This paper focuses on the problem of reconstructing a vector of rational...
research
03/11/2019

Fitting Tractable Convex Sets to Support Function Evaluations

The geometric problem of estimating an unknown compact convex set from e...
research
03/19/2021

Refined Least Squares for Support Recovery

We study the problem of exact support recovery based on noisy observatio...
research
10/27/2021

A characterization of normality via convex likelihood ratios

This work includes a new characterization of the multivariate normal dis...
research
10/17/2017

Combinatorial Penalties: Which structures are preserved by convex relaxations?

We consider the homogeneous and the non-homogeneous convex relaxations f...

Please sign up or login with your details

Forgot password? Click here to reset