Metadata only
Date
2017-07Type
- Conference Paper
Abstract
We present an approximation method to a class of parametric integration problems that naturally appear when solving the dual of the maximum entropy estimation problem. Our method builds up on a recent generalization of Gauss quadratures via an infinite-dimensional linear program, and utilizes a convex clustering algorithm to compute an approximate solution which requires reduced computational effort. It shows to be particularly appealing when looking at problems with unusual domains and in a multi-dimensional setting. As a proof of concept we apply our method to an example problem on the unit disc. Show more
Publication status
publishedExternal links
Book title
20th IFAC World Congress. ProceedingsJournal / series
IFAC-PapersOnLineVolume
Pages / Article No.
Publisher
ElsevierEvent
Subject
Entropy maximization; convex clustering; linear programming; importance samplingOrganisational unit
03751 - Lygeros, John / Lygeros, John
More
Show all metadata