Related papers: Two-outcome synchronous correlation sets and Conne…
The objective of this work is to study weak infeasibility in second order cone programming. For this purpose, we consider a relaxation sequence of feasibility problems that mostly preserve the feasibility status of the original problem.…
We give in this paper a convergence result concerning parallel synchronous algorithm for nonlinear fixed point problems with respect to the euclidian norm in $\Rn$. We then apply this result to some problems related to convex analysis like…
We solve a class of lifting problems involving approximate polynomial relations (soft polynomial relations). Various associated C*-algebras are therefore projective. The technical lemma we need is a new manifestation of Akemann and…
We show that the *-algebra of the product of two synchronous games is the tensor product of the corresponding *-algebras. We prove that the product game has a perfect C*-strategy if and only if each of the individual games does, and that in…
For the truncated multidimensional moment problem we introduce a notion of a canonical solution. Namely, canonical solutions are those solutions which are generated by commuting self-adjoint extensions inside the associated Hilbert space.…
Quantum theory imposes a strict limit on the strength of non-local correlations. It only allows for a violation of the CHSH inequality up to the value 2 sqrt(2), known as Tsirelson's bound. In this note, we consider generalized CHSH…
A complete contraction on a C*-algebra A, which preserves all closed two sided ideals J, can be approximated pointwise by elementary complete contractions if and only if the induced map on the tensor product of B with A/J is contractive for…
We study the convex-concave bilinear saddle-point problem $\min_x \max_y f(x) + y^\top Ax - g(y)$, where both, only one, or none of the functions $f$ and $g$ are strongly convex, and suitable rank conditions on the matrix $A$ hold. The…
We introduce the notion of a Tsirelson pair of C*-algebras, which is a pair of C*-algebras for which the space of quantum strategies obtained by using states on the minimal tensor product of the pair and the space of quantum strategies…
We introduce tensor network contraction algorithms for counting satisfying assignments of constraint satisfaction problems (#CSPs). We represent each arbitrary #CSP formula as a tensor network, whose full contraction yields the number of…
A particularly interesting instance of supervised learning with kernels is when each training example is associated with two objects, as in pairwise classification (Brunner et al., 2012), and in supervised learning of preference relations…
We consider Dirichlet problems for linear elliptic equations of second order in divergence form on a bounded or exterior smooth domain $\Omega$ in $\mathbb{R}^n$, $n \ge 3$, with drifts $\mathbf{b}$ in the critical weak $L^n$-space…
In this paper, it is proved a very general well-posedness result for a class of constrained minimization problems.
We give in this paper a convergence result concerning parallel asynchronous algorithm with bounded delays to solve a nonlinear fixed point problems. This result is applied to calculate the solution of a strongly monotone operator. Special…
In this paper, we study the linear complementarity problems on extended second order cones. We convert a linear complementarity problem on an extended second order cone into a mixed complementarity problem on the non-negative orthant. We…
In this paper, assuming the low-degree conjecture, we provide evidence of computational hardness for two problems: (1) the (partial) matching recovery problem in the sparse correlated Erd\H{o}s-R\'enyi graphs $\mathcal G(n,q;\rho)$ when the…
We establish conditions under which a continuous time reservoir computer, such as a leaky integrator echo state network, admits a generalised synchronisation $f$ between between the source dynamics and reservoir dynamics. We show that…
We continue the study of isomorphisms of tensor algebras associated to a C*-correspondences in the sense of Muhly and Solel. Inspired by by recent work of Davidson, Ramsey and Shalit, we solve isomorphism problems for tensor algebras…
We prove weak and strong convergence theorems for a double Krasnoselskij type iterative method to approximate coupled solutions of a bivariate nonexpansive operator F : C x C --> C, where C is a nonempty closed and convex subset of a…
Spingarn's method of partial inverses and the progressive decoupling algorithm address inclusion problems involving the sum of an operator and the normal cone of a linear subspace, known as linkage problems. Despite their success, existing…