Related papers: Convex optimization and contour deformations

We study obstructed deformation problems for two-dimensional residual Galois representations arising from weight~$2$ newforms of level~$N$. Using Poitou-Tate duality, we isolate local and global sources of obstructions and give concrete…

I investigate the Poisson-sigma model on the classical and quantum level. First I show how the interaction can be obtained by a deformation of the classical master equation of an Abelian BF theory in two dimensions. On the classical level…

We conjecture that many (maybe all) integrable equations and spin systems in 2+1 dimensions can be obtained from the (2+1)-dimensional Gauss-Mainardi-Codazzi and Gauss-Weingarten equations, respectively. We also show that the…

Motivated by the fact that not all nonconvex optimization problems are difficult to solve, we survey in this paper three widely-used ways to reveal the hidden convex structure for different classes of nonconvex optimization problems.…

We consider optimal control problems for partial differential equations where the controls take binary values but vary over the time horizon, they can thus be seen as dynamic switches. The switching patterns may be subject to combinatorial…

We propose a modified primal-dual method for general convex optimization problems with changing constraints. We obtain properties of Lagrangian saddle points for these problems which enable us to establish convergence of the proposed…

I propose a self-dual deformation of the classical phase space of lattice Yang--Mills theory, in which both the electric and magnetic fluxes take value in the gauge Lie group. A local construction of the deformed phase space requires the…

In the context of two-dimensional large-$N$ lattice Yang--Mills theory, we perform a refined study of the surface sums defined in the companion work [BCSK24]. In this setting, the surface sums are a priori expected to exhibit significant…

We develop a deformation method for attaining new magnetic monopole analytical solutions consistent with generalized Yang-Mills-Higgs model introduced recently. The new solutions fulfill the usual radially symmetric ansatz and the boundary…

We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…

This paper studies minimax optimization problems $\min_x \max_y f(x,y)$, where $f(x,y)$ is $m_x$-strongly convex with respect to $x$, $m_y$-strongly concave with respect to $y$ and $(L_x,L_{xy},L_y)$-smooth. Zhang et al. provided the…

This work presents a universal accelerated first-order primal-dual method for affinely constrained convex optimization problems. It can handle both Lipschitz and H\"{o}lder gradients but does not need to know the smoothness level of the…

In optimization the duality gap between the primal and the dual problems is a measure of the suboptimality of any primal-dual point. In classical mechanics the equations of motion of a system can be derived from the Hamiltonian function,…

This paper considers the analysis of continuous time gradient-based optimization algorithms through the lens of nonlinear contraction theory. It demonstrates that in the case of a time-invariant objective, most elementary results on…

A framework is presented whereby a general convex conic optimization problem is transformed into an equivalent convex optimization problem whose only constraints are linear equations and whose objective function is Lipschitz continuous.…

We consider extension of some established techniques of study of tensor fields on Lorentzian manifolds of arbitrary dimension to non-Abelian gauge covariant fields. These are then applied to study of gauge fields with vanishing scalar…

Convex optimization is a well-established research area with applications in almost all fields. Over the decades, multiple approaches have been proposed to solve convex programs. The development of interior-point methods allowed solving a…

We consider a linear-quadratic optimization problem with pointwise bounds on the state for which the constraint is given by the Laplace-Beltrami equation (to have uniqueness we add an lower order term) on a two-dimensional surface . By…

Minimal surfaces with planar curvature lines in the Euclidean space have been studied since the late 19th century. On the other hand, the classification of maximal surfaces with planar curvature lines in the Lorentz-Minkowski space has only…

We obtain asymptotic formulae with optimal error terms for the number of lattice points under and near a dilation of the standard parabola, the former improving upon an old result of Popov. These results can be regarded as achieving the…