Related papers: Analytic and Numerical Bootstrap for One-Matrix Mo…
We describe a semidefinite relaxation method which finds lower bounds to the ground state energy of a quantum Hamiltonian subject to Hermitian linear constraints along with approximations of ground state expectation values. We show that…
The principle and the efficiency of the Monte Carlo transfer-matrix algorithm are discussed. Enhancements of this algorithm are illustrated by applications to several phase transitions in lattice spin models. We demonstrate how the…
Whether O(N)-invariant conformal field theory exists in five dimensions with its implication to higher-spin holography was much debated. We find an affirmative result on this question by utilizing conformal bootstrap approach. In solving…
We study the statistical Ising model of spins on the infinite lattice using a bootstrap method that combines spin-flip identities with positivity conditions, including reflection positivity and Griffiths inequalities, to derive rigorous…
The linearly constrained matrix rank minimization problem is widely applicable in many fields such as control, signal processing and system identification. The tightest convex relaxation of this problem is the linearly constrained nuclear…
An existing solvability result for relaxed one-sided Lipschitz algebraic inclusions is substantially improved. This enhanced solvability result allows the design of a very robust numerical method for the approximation of a solution of the…
In this paper, we study the polynomial optimization problem of multi-forms over the intersection of the multi-spheres and the nonnegative orthants. This class of problems is NP-hard in general, and includes the problem of finding the best…
We present a technique for producing valid dual bounds for nonconvex quadratic optimization problems. The approach leverages an elegant piecewise linear approximation for univariate quadratic functions due to Yarotsky, formulating this…
We propose an iterative algorithm for low-rank matrix completion that can be interpreted as both an iteratively reweighted least squares (IRLS) algorithm and a saddle-escaping smoothing Newton method applied to a non-convex rank surrogate…
Matrix trace estimation is ubiquitous in machine learning applications and has traditionally relied on Hutchinson's method, which requires $O(\log(1/\delta)/\epsilon^2)$ matrix-vector product queries to achieve a $(1 \pm…
We describe compressible two-phase flows by a single-velocity six-equation flow model, which is composed of the phasic mass and total energy equations, one volume fraction equation, and the mixture momentum equation. The model contains…
In this paper we address the problem of performing statistical inference for large scale data sets i.e., Big Data. The volume and dimensionality of the data may be so high that it cannot be processed or stored in a single computing node. We…
The anisotropic Cahn-Hilliard equation is often used to model the formation of faceted pyramids on nanoscale crystal surfaces. In comparison to the isotropic Cahn-Hilliard model, the nonlinear terms associated with strong anisotropic…
This paper is focuses on the computation of the positive moments of one-side correlated random Gram matrices. Closed-form expressions for the moments can be obtained easily, but numerical evaluation thereof is prone to numerical stability,…
In this paper, we propose a moment method to numerically solve the Vlasov equations using the framework of the NRxx method developed in [6, 8, 7] for the Boltzmann equation. Due to the same convection term of the Boltzmann equation and the…
An important element of the $S$-matrix bootstrap program is the relationship between the modulus of an $S$-matrix element and its phase. Unitarity relates them by an integral equation. Even in the simplest case of elastic scattering, this…
The modern S-Matrix Bootstrap provides non-perturbative bounds on low-energy aspects of scattering amplitudes, leveraging the constraints of unitarity, analyticity and crossing. Typically, the solutions saturating such bounds also saturate…
We develop a novel, fundamental and surprisingly simple randomized iterative method for solving consistent linear systems. Our method has six different but equivalent interpretations: sketch-and-project, constrain-and-approximate, random…
Nonlinear matrix equations arise in many practical contexts related to control theory, dynamical programming and finite element methods for solving some partial differential equations. In most of these applications, it is needed to compute…
We propose a bootstrap-based calibrated projection procedure to build confidence intervals for single components and for smooth functions of a partially identified parameter vector in moment (in)equality models. The method controls…