相关论文: The realizability problem as a special case of the…
We introduce a new strategy in solving the truncated complex moment problem. To this aim we investigate recursive doubly indexed sequences and their characteristic polynomials. A characterization of recursive doubly indexed \emph{moment}…
This paper explores some sufficient conditions for the enhanced solvability of strong vector equilibrium problems, which can be established via a variational approach. Enhanced solvability here means existence of solutions, which are strong…
We explain how recent developments in the fields of realisability models for linear logic -- or geometry of interaction -- and implicit computational complexity can lead to a new approach of implicit computational complexity. This…
We deal with the following general version of the classical moment problem: when can a linear functional on a unital commutative real algebra $A$ be represented as an integral with respect to a Radon measure on the character space $X(A)$ of…
This paper is a continuation of our previous investigation on the truncated matrix trigonometric moment problem in Ukrainian Math. J., 2011, 63, no.6, 786-797. In the present paper we obtain a Nevanlinna-type formula for this moment problem…
Various control schemes rely on a solution of a convex optimization problem involving a particular robust quadratic constraint, which can be reformulated as a linear matrix inequality using the well-known $\mathcal{S}$-lemma. However, the…
Motivated by the success of bounded model checking framework for finite state machines, Ouaknine and Worrell proposed a time-bounded theory of real-time verification by claiming that restriction to bounded-time recovers decidability for…
We study the truncated multidimensional moment problem with a general type of truncations. The operator approach to the moment problem is presented. A way to construct atomic solutions of the moment problem is indicated.
We present an approach to approximate reachable sets for linear systems with bounded L-infinity controls in finite time. Our first approach investigates the boundaries of these sets and reveals an exact characterization for single-input,…
We employ positivity of Riesz functionals to establish representing measures (or approximate representing measures) for truncated multivariate moment sequences. For a truncated moment sequence $y$, we show that $y$ lies in the closure of…
Generalized moment problems optimize functional expectation over a class of distributions with generalized moment constraints, i.e., the function in the moment can be any measurable function. These problems have recently attracted growing…
The main result of the paper gives criteria for extendibility of sesquilinear form-valued mappings defined on symmetric subsets of *-semigroups to positive definite ones. By specifying this we obtain new solutions of: * the truncated…
In this paper, we study a matricial version of the Byrnes-Georgiou-Lindquist generalized moment problem with complexity constraint. We introduce a new metric on multivariable spectral densities induced by the family of their spectral…
We characterize the existence of the $L^1$ solutions of the truncated moments problem in several real variables on unbounded supports by the existence of the maximum of certain concave Lagrangian functions. A natural regularity assumption…
We study the complexity of constraint satisfaction problems involving global constraints, i.e., special-purpose constraints provided by a solver and represented implicitly by a parametrised algorithm. Such constraints are widely used;…
The (classical) truncated moment problem, extensively studied by Curto and Fialkow, asks to characterize when a finite sequence of real numbers indexes by words in commuting variables can be represented with moments of a positive Borel…
Models of a generalized nondeterminism are defined by limitations on nonde- terministic behavior of a computing device. A regular realizability problem is a problem of verifying existence of a special sort word in a regular language. These…
We study the inverse problem, or inverse design problem, for a time-evolution Hamilton-Jacobi equation. More precisely, given a target function $u_T$ and a time horizon $T>0$, we aim to construct all the initial conditions for which the…
We revisit a fundamental result in real-time verification, namely that the binary reachability relation between configurations of a given timed automaton is definable in linear arithmetic over the integers and reals. In this paper we give a…
We characterize the existence of the Lebesgue integrable solutions of the truncated problem of moments in several variables on unbounded supports by the existence of some maximum entropy -- type representing densities and discuss a few…