Related papers: The inverse moment problem for convex polytopes
Points of an orbit of a finite Coxeter group G, generated by n reflections starting from a single seed point, are considered as vertices of a polytope (G-polytope) centered at the origin of a real n-dimensional Euclidean space. A general…
Let P be a convex polytope not simple in general. In the focus of this paper lies a simplicial complex K_P which carries complete information about the combinatorial type of P. In the case when P is simple, K_P is the same as dP*, where P*…
We present an explicit closed-form formula for the vertices of the classical cut polytope $\operatorname{CUT}(n)$, defined as the convex hull of cut vectors of the complete graph $K_n$. Our derivation proceeds via a related polytope,…
This paper studies the problem of reconstructing binary matrices that are only accessible through few evaluations of their discrete X-rays. Such question is prominently motivated by the demand in material science for developing a tool for…
The classical $\overline \partial$-method has been generalized recently [lnv], [lnv2] to be used in the presence of exceptional points. We apply this generalization to solve Dirac inverse scattering problem with weak assumptions on…
Inverse eigenvalue and singular value problems have been widely discussed for decades. The well-known result is the Weyl-Horn condition, which presents the relations between the eigenvalues and singular values of an arbitrary matrix. This…
We consider the complex moment problem, that is the problem of constructing a positive Borel measure on $\mathbb{C}$ from a given set of moments. We relate this problem to the dynamic inverse problem for the discrete system associated with…
Consider the geometric inverse problem: There is a set of delta-sources in spacetime that emit waves travelling at unit speed. If we know all the arrival times at the boundary cylinder of the spacetime, can we reconstruct the space, a…
Given a quadratic map Q : K^n -> K^k defined over a computable subring D of a real closed field K, and a polynomial p(Y_1,...,Y_k) of degree d, we consider the zero set Z=Z(p(Q(X)),K^n) of the polynomial p(Q(X_1,...,X_n)). We present a…
We study a combinatorial notion where given a set of lattice points one takes the set of all sums of subsets of a fixed size, and we ask if the given set comes from a convex lattice polytope whether the resulting set also comes from a…
This paper extends the model reduction method by the operator projection to the one-dimensional special relativistic Boltzmann equation. The derivation of arbitrary order globally hyperbolic moment system is built on our careful study of…
We consider forecasting a single time series using a large number of predictors in the presence of a possible nonlinear forecast function. Assuming that the predictors affect the response through the latent factors, we propose to first…
The author was encouraged to write this review by numerous enquiries from researchers all over the world, who needed a ready-to-use algorithm for the inversion of confluent Vandermonde matrices which works in quadratic time for any values…
In this work, we introduce new families of nonconforming approximation methods for reconstructing functions on general polygonal meshes. These methods are defined using degrees of freedom based on weighted moments of orthogonal polynomials…
Unknown-view tomography (UVT) reconstructs a 3D density map from its 2D projections at unknown, random orientations. A line of work starting with Kam (1980) employs the method of moments (MoM) with rotation-invariant Fourier features to…
This paper initiates a systematic development of a theory of non-commutative optimization. It aims to unify and generalize a growing body of work from the past few years which developed and analyzed algorithms for natural geodesically…
We address the problem of constructing elliptic polytopes in R^d, which are convex hulls of finitely many two-dimensional ellipses with a common center. Such sets arise in the study of spectral properties of matrices, asymptotics of long…
In this note, we state and give the main ideas of the proof of a real convexity theorem for group-valued momentum maps. This result is a quasi-Hamiltonian analogue of the O'Shea-Sjamaar theorem in the usual Hamiltonian setting. We prove…
Let $G$ be a bounded open subset of Euclidean space with real algebraic boundary $\Gamma$. Under the assumption that the degree $d$ of $\Gamma$ is given, and the power moments of the Lebesgue measure on $G$ are known up to order $3d$, we…
Recently, several works have shown that natural modifications of the classical conditional gradient method (aka Frank-Wolfe algorithm) for constrained convex optimization, provably converge with a linear rate when: i) the feasible set is a…