Related papers: The inverse moment problem for convex polytopes: i…
Using standard tools of harmonic analysis, we state and solve the problem of moments for non-negative measures supported on the unit ball of a Sobolev space of multivariate periodic trigonometric functions. We describe outer and inner…
A set of orthonormal polynomials is proposed for image reconstruction from projection data. The relationship between the projection moments and image moments is discussed in detail, and some interesting properties are demonstrated.…
We show that the multivariate generating function of appropriately normalized moments of a measure with homogeneous polynomial density supported on a compact polytope P in R^d is a rational function. Its denominator is the product of linear…
Matrix completion is a well-studied problem with many machine learning applications. In practice, the problem is often solved by non-convex optimization algorithms. However, the current theoretical analysis for non-convex algorithms relies…
The affine inverse eigenvalue problem consists of identifying a real symmetric matrix with a prescribed set of eigenvalues in an affine space. Due to its ubiquity in applications, various instances of the problem have been widely studied in…
Motivated by the inverse moment problem for convex polytopes, we study the pushforward to a line of the Lebesgue measure restricted to a convex $d$-polytope. Such pushforwards are spline densities of degree $d-1$, and their moments lead…
In this paper, we investigate moment methods from a general point of view using an operator notation. This theoretical approach lets us explore the moment closure problem in more detail. This gives rise to a new idea, proposed in…
Determining if a point is in a polygon or not is used by a lot of applications in computer graphics, computer games and geoinformatics. Implementing this check is error-prone since there are many special cases to be considered. This holds…
This paper is devoted to the general problem of projection onto a polyhedral convex cone generated by a finite set of generators.This problem is reformulated into projection onto the polytope obtained by simple truncation of the original…
This paper provides full \Matlab-code and informal correctness proofs for the lexicographic reverse search algorithm for convex hull calculations. The implementation was tested on a 1993 486-PC for various small and some larger, partially…
We study a class of projective transformations of spectraplexes associated with self-dual cones and, on this basis, propose a polynomial-time algorithm for convex feasibility problems with positive definite constraints. At each iteration of…
Tensors are fundamental in mathematics, computer science, and physics. Their study through algebraic geometry and representation theory has proved very fruitful in the context of algebraic complexity theory and quantum information. In…
In this paper, we address a particular case of Calder\'on's (or conductivity) inverse problem in dimension two, namely the case of a homogeneous background containing a finite number of cavities (i.e. heterogeneities of infinitely high…
There are many space subdivision and space partitioning techniques used in many algorithms to speed up computations. They mostly rely on orthogonal space subdivision, resp. using hierarchical data structures, e.g. BSP trees, quadtrees,…
In this paper, we develop a numerical algorithm for an inverse problem on determining fractional orders of time derivatives simultaneously in a coupled subdiffusion system. Following the theoretical uniqueness, we reformulate the order…
We consider the following geometric optimization problem: find a maximum-area rectangle and a maximum-perimeter rectangle contained in a given convex polygon with $n$ vertices. We give exact algorithms that solve these problems in time…
We study the problem of covering a given set of $n$ points in a high, $d$-dimensional space by the minimum enclosing polytope of a given arbitrary shape. We present algorithms that work for a large family of shapes, provided either only…
An approximate method is proposed for the recovery of a compactly supported spherically-symmetric potential from the set of fixed-energy phase-shifts known for all angular momenta. The method reduces the inverse scattering problem to a…
Recently, there has been increasing interest and progress in improvising the approximation algorithm for well-known NP-Complete problems, particularly the approximation algorithm for the Vertex-Cover problem. Here we have proposed a…
We study the problem of reconstructing a positive discrete measure on a compact set $K \subseteq \mathbb{R}^n$ from a finite set of moments (possibly known only approximately) via convex optimization. We give new uniqueness results, new…