Related papers: Non-extremal sextic moment problems
We show first that there are intrinsic relationships among different conditions, old and recent, which lead to some general statements in both the Stieltjes and the Hamburger moment problems. Then we describe checkable conditions and prove…
This paper presents a method to approximately solve stochastic optimal control problems in which the cost function and the system dynamics are polynomial. For stochastic systems with polynomial dynamics, the moments of the state can be…
For a class of quasi-variational inequalities (QVIs) of obstacle-type the stability of its solution set and associated optimal control problems are considered. These optimal control problems are non-standard in the sense that they involve…
A finitely generated quadratic module or preordering in the real polynomial ring is called stable, if it admits a certain degree bound on the sums of squares in the representation of polynomials. Stability, first defined explicitly by…
We describe all solutions of the matrix Hamburger moment problem in a general case (no conditions besides solvability are assumed). We use the fundamental results of A.V. Shtraus on the generalized resolvents of symmetric operators. All…
The numerical performance of algorithms can be studied using test sets or procedures that generate such problems. This paper proposes various methods for generating linear, semidefinite, and second-order cone optimization problems.…
We derive conservative, multidimensional, energy-dependent moment equations for neutrino transport in core-collapse supernovae and related astrophysical systems, with particular attention to the consistency of conservative four-momentum and…
We begin a systematic study of positivity and moment problems in an equivariant setting. Given a reductive group $G$ over $\R$ acting on an affine $\R$-variety $V$, we consider the induced dual action on the coordinate ring $\R[V]$ and on…
The Nystr\"om method is a popular choice for finding a low-rank approximation to a symmetric positive semi-definite matrix. The method can fail when applied to symmetric indefinite matrices, for which the error can be unboundedly large. In…
Why is it that semidefinite relaxations have been so successful in numerous applications in computer vision and robotics for solving non-convex optimization problems involving rotations? In studying the empirical performance we note that…
Due to its intimate relation to Spectral Theory and Schr\"{o}dinger operators, the multivariate moment problem has been a subject of many researches, so far without essential success (if one compares with the one--dimensional case). In the…
We consider vector and set optimization problems with respect to variable domination structures given by set-valued mappings acting between the preimage space and the image space of the objective mapping, as well as by set-valued mappings…
The matrix rank minimization problem has applications in many fields such as system identification, optimal control, low-dimensional embedding, etc. As this problem is NP-hard in general, its convex relaxation, the nuclear norm minimization…
We consider a generic basic semi-algebraic subset $\mathcal{S}$ of the space of generalized functions, that is a set given by (not necessarily countably many) polynomial constraints. We derive necessary and sufficient conditions for an…
In this paper, we consider linear functionals defined on an unital commutative real algebra A and establish characterizations for moment functionals on compact sets of characters that depend only on the given functional. For example, we…
Originally developed for imputing missing entries in low rank, or approximately low rank matrices, matrix completion has proven widely effective in many problems where there is no reason to assume low-dimensional linear structure in the…
Non-stationary approximations of the final value of a converging sequence are discussed, and we show that extremal eigenvalues can be reasonably estimated from the CG iterates without much computation at all. We introduce estimators of…
We consider an optimal control problem governed by an elliptic variational inequality of the second kind. The problem is discretized by linear finite elements for the state and a variational discrete approach for the control. Based on a…
In this paper, we propose some new semidefinite relaxations for a class of nonconvex complex quadratic programming problems, which widely appear in the areas of signal processing and power system. By deriving new valid constraints to the…
The nonnegative rank of an entrywise nonnegative matrix A of size mxn is the smallest integer r such that A can be written as A=UV where U is mxr and V is rxn and U and V are both nonnegative. The nonnegative rank arises in different areas…