Related papers: Convex optimization and contour deformations
We suggest an approach for simulating theories with a sign problem that relies on optimisation of complex integration contours that are not restricted to lie along Lefschetz thimbles. To that end we consider the toy model of a…
We apply constant imaginary offsets to the path integral for a reduction of the sign problem in the Hubbard model. These simple transformations enhance the quality of results from HMC calculations without compromising the speed of the…
We study the heavy-dense limit of QCD on the lattice with heavy quarks at high density. The effective three dimensional theory has a sign problem which is alleviated by sign optimization where the path integration domain is deformed in…
We studied integration contour deformations in the chiral random matrix theory of Stephanov with the goal of alleviating the finite-density sign problem. We considered simple ans\"atze for the deformed integration contours, and optimized…
We study the 2+1 dimensional XY model at nonzero chemical potential $\mu$ on deformed integration manifolds, with the aim of alleviating its sign problem. We investigate several proposals for the deformations, and considerably improve on…
Non-convex optimization problems have multiple local optimal solutions. Non-convex optimization problems are commonly found in numerous applications. One of the methods recently proposed to efficiently explore multiple local optimal…
We study the sign problem in the Hubbard model on the hexagonal lattice away from half-filling using the Lefschetz thimbles method. We identify the saddle points, reduce their amount, and perform quantum Monte Carlo (QMC) simulations using…
We prove an existence result for the deformed Hermitian Yang-Mills equation for the full admissible range of the phase parameter, i.e., $\hat{\theta} \in (\frac{\pi}{2},\frac{3\pi}{2})$, on compact complex three-folds conditioned on a…
This paper is devoted to the theoretical and numerical investigation of an augmented Lagrangian method for the solution of optimization problems with geometric constraints. Specifically, we study situations where parts of the constraints…
In recent years a new class of supersymmetric lattice theories have been proposed which retain one or more exact supersymmetries for non-zero lattice spacing. Recently there has been some controversy in the literature concerning whether…
The purpose of this paper is to investigate the parabolic deformed Hermitian-Yang-Mills equation with hypercritical phase in a smooth domain $\Omega\subset \mathbb{C}^{n}$. By using $J$-functional, we are able to prove the convergence of…
We address the problem of solving convex optimization problems with many convex constraints in a distributed setting. Our approach is based on an extension of the alternating direction method of multipliers (ADMM) that recently gained a lot…
We present numerical results for pure SU(2) Yang-Mills theory in four space-time dimensions using a novel algorithm based on dually transformed variables. The simulation makes use of a recently derived O(j^4) algorithm for the dual vertex…
Hidden convexity is a powerful idea in optimization: under the right transformations, nonconvex problems that are seemingly intractable can be solved efficiently using convex optimization. We introduce the notion of a Lagrangian dual…
Recently there has been some controversy in the literature concerning the existence of a fermion sign problem in the $\mathcal{N}=(2,2)$ supersymmetric Yang--Mills (SYM) theories on the lattice. In this work, we address this issue by…
We prove existence of an optimal transport map in the Monge-Kantorovich problem associated to a cost $c(x,y)$ which is not finite everywhere, but coincides with $|x-y|^2$ if the displacement $y-x$ belongs to a given convex set $C$ and it is…
In this paper, we propose a new Fully Composite Formulation of convex optimization problems. It includes, as a particular case, the problems with functional constraints, max-type minimization problems, and problems of Composite…
A convex optimization problem in conic form involves minimizing a linear functional over the intersection of a convex cone and an affine subspace. In some cases, it is possible to replace a conic formulation using a certain cone, with a…
Monte Carlo methods cannot probe far into the QCD phase diagram with a real chemical potential, due to the famous sign problem. Complex Langevin simulations, using adaptive step-size scaling and gauge cooling, are suited for sampling path…
We propose a new approach to circumvent the sign problem in which the integration path is optimized to control the sign problem. We give a trial function specifying the integration path in the complex plane and tune it to optimize the cost…