Related papers: On the two-dimensional moment problem
The main purpose of this paper is to study the NP-complete subset-sum problem, not in the usual context of time-complexity-based classification of the algorithms (exponential/polynomial), but through a new kind of algorithmic classification…
Triangulation of a three-dimensional point from at least two noisy 2-D images can be formulated as a quadratically constrained quadratic program. We propose an algorithm to extract candidate solutions to this problem from its semidefinite…
For the system of second order quasilinear parabolic equations the problem of reducing them to the equations of diffusion type is considered. In non-degenerate case an effective algorithm for solving this problem is suggested.
The paper develops a second-order time-domain moment matching framework for the structure-preserving model reduction of second-order dynamical systems of high dimension, avoiding the first-order double-sized equivalent system. The moments…
We give a detailed technical report on the implementation of the algorithm presented in Gravin et al. (Discrete & Computational Geometry'12) for reconstructing an $N$-vertex convex polytope $P$ in $\mathbb{R}^d$ from the knowledge of…
The work deals with the existence of solutions of a certain system of quadratic integral equations in H^2(R^d,R^N), d = 2, 3. We demonstrate the existence of a perturbed solution by virtue of a fixed point technique.
This paper concerns with numerical approximations of solutions of second order fully nonlinear partial differential equations (PDEs). A new notion of weak solutions, called moment solutions, is introduced for second order fully nonlinear…
In this paper we study the truncated operator trigonometric moment problem. All solutions of the moment problem are described by a Nevanlinna-type parameterization. In the case of moments acting in a separable Hilbert space, the matrices of…
This paper presents a fast algorithm to solve a spectral estimation problem for two-dimensional random fields. The latter is formulated as a convex optimization problem with the Itakura-Saito pseudodistance as the objective function subject…
This paper is about the moment problem on a finite-dimensional vector space of continuous functions. We investigate the structure of the convex cone of moment functionals (supporting hyperplanes, exposed faces, inner points) and treat…
This paper considers the problem of designing a dynamical system to solve constrained optimization problems in a distributed way and in an anytime fashion (i.e., such that the feasible set is forward invariant). For problems with separable…
A general quantum algorithm for solving a problem is discussed. The number of steps required to solve a problem using this method is independent of the number of cases that has to be considered classically. Hence, it is more efficient than…
The large moment method can be used to compute a large number of moments of physical quantities that are described by coupled systems of linear differential equations. Besides these systems the algorithm requires a certain number of initial…
We expose in full detail a constructive procedure to invert the so--called "finite Markov moment problem". The proofs rely on the general theory of Toeplitz matrices together with the classical Newton's relations.
We present a deterministic polynomial-time algorithm that solves the 3-satisfiability problem.
The main goal of this paper is to achieve a parametrization of the solution set of the truncated matricial Hausdorff moment problem in the non-degenerate and degenerate situation. We treat the even and the odd cases simultaneously. Our…
We prove a solvability theorem for the Stieltjes moment problem on $R^d$ which is based on the multivariate Stieltjes condition $\sum_{n=1}^\infty L(x_j^n)^{-1/(2n)}=+\infty$, $j=1,\dots,d.$ This result is applied to derive a new…
Our research deals with the optimization version of the set partition problem, where the objective is to minimize the absolute difference between the sums of the two disjoint partitions. Although this problem is known to be NP-hard and…
The $k$-subset sum problem over finite fields is a classical NP-complete problem.Motivated by coding theory applications, a more complex problem is the higher $m$-th moment $k$-subset sum problem over finite fields. We show that there is a…
In this paper we give a complete solution of the following "polynomial moment problem" which arose about 10 years ago in connection with Poincare's center-focus problem. For a given polynomial P(z) to describe polynomials Q(z) orthogonal to…