Related papers: Applications of gauge duality in robust principal …
Optimization methods are at the core of many problems in signal/image processing, computer vision, and machine learning. For a long time, it has been recognized that looking at the dual of an optimization problem may drastically simplify…
The duality angles deformation developed by de Roo and Wagemans within the context of N=4 gauged supergravity is used in order to study certain classes of gaugings of N=8 supergravity, namely, those that are consistent when halving the…
We study deformations of dualities in finite N=2 supersymmetric QCD. Adding mass terms for some quarks and the adjoint matter to the finite N=2 theory, which is known to have dual descriptions, the correspondence of gauge invariant…
We study the soft breaking of N=2 self-dual gauge theories down to N=0 by promoting the coupling constant and hypermultiplet masses to spurions, and we analyze the microscopic duality symmetry in the resulting models. Explicit formulae are…
Recently, Yamanaka and Yamashita proposed the so-called positively homogeneous optimization problem, which includes many important problems, such as the absolute-value and the gauge optimizations. They presented a closed form of the dual…
In this paper, we show a way to exploit sparsity in the problem data in a primal-dual potential reduction method for solving a class of semidefinite programs. When the problem data is sparse, the dual variable is also sparse, but the primal…
This is a general introduction to electric-magnetic duality in non-abelian gauge theories. In chapter I, I review the general ideas which led in the late 70s to the idea of electric/magnetic duality in quantum field theory. In chapters II…
In this article we develop a duality principle suitable for a large class of problems in optimization. The main result is obtained through basic tools of convex analysis and duality theory. We establish a correct relation between the…
The possibilities of exploiting the special structure of d.c. programs, which consist of optimizing the difference of convex functions, are currently more or less limited to variants of the DCA proposed by Pham Dinh Tao and Le Thi Hoai An…
Lagrangian duality in mixed integer optimization is a useful framework for problems decomposition and for producing tight lower bounds to the optimal objective, but in contrast to the convex counterpart, it is generally unable to produce…
We study the problem of super-resolution, where we recover the locations and weights of non-negative point sources from a few samples of their convolution with a Gaussian kernel. It has been recently shown that exact recovery is possible by…
We investigate the phase structures of various N=1 supersymmetric gauge theories including even the exceptional gauge group from the viewpoint of superconvergence of the gauge field propagator. Especially we analyze in detail whether a new…
A method for implementing non-Abelian duality on string backgrounds is given. It is shown that a direct generalisation of the familiar Abelian duality induces an extra local symmetry in the gauge invariant theory. The non-Abelian isometry…
In this work, we show that for linearly constrained optimization problems the primal-dual hybrid gradient algorithm, analyzed by Chambolle and Pock [3], can be written as an entirely primal algorithm. This allows us to prove convergence of…
The proposed coordinate/field duality [Phys. Rev. Lett. 78 (1997) 163] is applied to the gauge and matter sectors of gauge theories. In the non-Abelian case, due to indices originated from the internal space, the dual coordinates appear to…
We survey research that studies the connection between the computational complexity of optimization problems on the one hand, and the duality gap between the primal and dual optimization problems on the other. To our knowledge, this is the…
The paper is dedicated to the study of strong duality for a problem of linear copositive programming. Based on the recently introduced concept of the set of normalized immobile indices, an extended dual problem is deduced. The dual problem…
This paper is aimed to prove the strong duality theorem for continuous-time linear programming problems in which the coefficients are assumed to be piecewise continuous functions. The previous paper proved the strong duality theorem for the…
This article develops a duality principle for a class of optimization problems in $\mathbb{R}^n$. The results are obtained based on standard tools of convex analysis and on a well known result of Toland for D.C. optimization. Global…
Duality in supersymmetric SU(N) gauge theory with a symmetric tensor is studied using the technique of deconfining and Seiberg's duality. By construction the gauge group of the dual theory necessarily becomes a product group. In order to…