Related papers: The inverse moment problem for convex polytopes: i…

In this paper we give refinements of some convex and log-convex moment inequalities of the first and second order using a special kind of positive semi-definite form. An open problem concerning eight parameter refinement of second order is…

This article presents the numerical verification and validation of several inversion algorithms for V-line transforms (VLTs) acting on symmetric 2-tensor fields in the plane. The analysis of these transforms and the theoretical foundation…

We consider the task of reconstructing polytopes with fixed facet directions from finitely many support function evaluations. We show that for a fixed simplicial normal fan the least-squares estimate is given by a convex quadratic program.…

A new algorithm for the efficient numerical approximation of weakly singular integrals over convex polytopes is introduced. Such integrals appear in the Galerkin discretizations of integral equations and nonlocal partial differential…

Time-varying optimization problems are prevalent in various engineering fields, and the ability to solve them accurately in real-time is becoming increasingly important. The prediction-correction algorithms used in smooth time-varying…

In this paper we analyze several new methods for solving nonconvex optimization problems with the objective function formed as a sum of two terms: one is nonconvex and smooth, and another is convex but simple and its structure is known.…

An inverse scattering problem for the 3D acoustic equation in time domain is considered. The unknown spatially distributed speed of sound is the subject of the solution of this problem. A single location of the point source is used. Using a…

We introduce machine learning methodology to the study of lattice polytopes. With supervised learning techniques, we predict standard properties such as volume, dual volume, reflexivity, etc, with accuracies up to 100%. We focus on 2d…

We propose a novel iterative numerical method to solve the three-dimensional inverse obstacle scattering problem of recovering the shape of the obstacle from far-field measurements. To address the inherent ill-posed nature of the inverse…

Eigensolvers involving complex moments can determine all the eigenvalues in a given region in the complex plane and the corresponding eigenvectors of a regular linear matrix pencil. The complex moment acts as a filter for extracting…

We consider the bin packing problem with $d$ different item sizes and revisit the structure theorem given by Goemans and Rothvo\ss [6] about solutions of the integer cone. We present new techniques on how solutions can be modified and give…

Imprecise measurements of a point set P = (p1, ..., pn) can be modelled by a family of regions F = (R1, ..., Rn), where each imprecise region Ri contains a unique point pi. A retrieval models an accurate measurement by replacing an…

The numerical algorithm of the inverse quantum scattering is developed. This algorithm is based on the Marchenko theory, and includes three steps. The first one is the algebraic Pade approximation of the unitary S-matrix, what is realized…

Let $P$ be a planar set of $n$ points in general position. We consider the problem of computing an orientation of the plane for which the Rectilinear Convex Hull of $P$ has minimum area. Bae et al. (Computational Geometry: Theory and…

We consider an inverse problem for a finite graph $(X,E)$ where we are given a subset of vertices $B\subset X$ and the distances $d_{(X,E)}(b_1,b_2)$ of all vertices $b_1,b_2\in B$. The distance of points $x_1,x_2\in X$ is defined as the…

Let $\mathcal{P}$ be an $n$-dimensional convex polytope and $\mathcal{S}$ be a hypersurface in $\mathbb{R}^n$. This paper investigates potentials to reconstruct $\mathcal{P}$ or at least to compute significant properties of $\mathcal{P}$ if…

The volume is an important attribute of a convex body. In general, it is quite difficult to calculate the exact volume. But in many cases, it suffices to have an approximate value. Volume estimation methods for convex bodies have been…

Coverings of convex bodies have emerged as a central component in the design of efficient solutions to approximation problems involving convex bodies. Intuitively, given a convex body $K$ and $\epsilon> 0$, a covering is a collection of…

Constrained non-convex optimization is fundamentally challenging, as global solutions are generally intractable and constraint qualifications may not hold. However, in many applications, including safe policy optimization in control and…

We prove the $W^{1,2}_p$-estimate and solvability for the Dirichlet problem of second-order parabolic equations in simple convex polytopes with time irregular coefficients, when $p\in (1,2]$. We also consider the corresponding Neumann…