Related papers: A new approach to the 2-variable subnormal complet…
The best current estimates of the thresholds for the existence of solutions in random constraint satisfaction problems ('CSPs') mostly derive from the first and the second moment method. Yet apart from a very few exceptional cases these…
In this work we are interested in nonlinear symmetric cone problems (NSCPs), which contain as special cases nonlinear semidefinite programming, nonlinear second order cone programming and the classical nonlinear programming problems. We…
This paper analyzes the performance of sequential importance sampling algorithms for estimating the number of perfect matchings in bipartite graphs. Precise bounds on the number of samples required to yield an accurate estimate are derived.…
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…
The Stacker Crane Problem (SCP) is a variant of the Traveling Salesman Problem. In SCP, pairs of pickup and delivery points are designated on a graph, and a crane must visit these points to move objects from each pickup location to its…
We investigate the Constraint Satisfaction Problem (CSP) over templates with a group structure, and algorithms solving CSP that are equivariant, i.e. invariant under a natural group action induced by a template. Our main result is a method…
Conformal Prediction (CP) is a popular framework for constructing prediction bands with valid coverage in finite samples, while being free of any distributional assumption. A well-known limitation of conformal prediction is the lack of…
The main goal of this paper is to reconsider a phenomenon which was treated in earlier work of the authors' on several truncated matricial moment problems. Using a special kind of Schur complement we obtain a more transparent insight into…
The reviewed paper describes an analog device that empirically solves small instances of the NP-complete Subset Sum Problem (SSP). The authors claim that this device can solve the SSP in polynomial time using polynomial space, in principle,…
We establish relationships between the classical moments problems which are problems of a construction of a measure supported on a real line, on a half-line or on an interval from prescribed set of moments with the Boundary control approach…
We present an algorithm to compute the exact value of the packing measure of self-similar sets satisfying the so called SSC and prove its convergence to the value of the packing measure. We also test the algorithm with examples that show…
One possible solution to the strong CP problem is that CP is an exact symmetry, spontaneously broken at some scale. Some years ago, Nelson and Barr suggested a mechanism for obtaining $\theta=0$ at tree level in this framework, and showed…
In this paper, we propose a new sequential quadratic semidefinite programming (SQSDP) method for solving degenerate nonlinear semidefinite programs (NSDPs), in which we produce iteration points by solving a sequence of stabilized quadratic…
This paper considers a fractional programming problem (P) which minimizes a ratio of quadratic functions subject to a two-sided quadratic constraint. As is well-known, the fractional objective function can be replaced by a parametric family…
In many stochastic models, the observables of interest are naturally encoded in double transforms (e.g., Laplace transforms) that couple spatial and temporal variables. Notably, the double transform often provides the only analytically…
Spherically symmetric accretion incorporating self-gravity constitutes a three-point boundary value problem (TPBVP) governed by constraints at the outer boundary, sonic point, and accretor surface. Previous studies have two limitations:…
In this work we study the {\it moment estimation} problem using weighted sampling. Given sample access to a set $A$ with $n$ weighted elements, and a parameter $t>0$, we estimate the $t$-th moment of $A$ given as $S_t=\sum_{a\in A} w(a)^t$.…
We present an alternative solution to nonsingular cubic moment problems, using techniques that are expected to be useful for higher-degree truncated moment problems. In particular, we apply the theory of recursively determinate moment…
Despite much research, hard weighted problems still resist super-polynomial improvements over their textbook solution. On the other hand, the unweighted versions of these problems have recently witnessed the sought-after speedups.…
Surrogate models (including deep neural networks and other machine learning algorithms in supervised learning) are capable of approximating arbitrarily complex, high-dimensional input-output problems in science and engineering, but require…