Related papers: Convex optimization and contour deformations
Motivated by Calabi's calculation of the second variation sign for locally strongly convex affine maximal surfaces in equiaffine geometry, we first prove that every Calabi extremal surface is also maximal in the Calabi affine geometry. By…
We propose a systematic way of finding solutions to classical Yang-Mills equation with nontrivial topology. This approach is based on one of Wightman axioms for quantum field theory, which is referred to as form invariance condition in this…
Yuan's theorem of the alternative is an important theoretical tool in optimization, which provides a checkable certificate for the infeasibility of a strict inequality system involving two homogeneous quadratic functions. In this paper, we…
Optimizing an implicational base of a closure system consists in turning this implicational base into an equivalent one with premises and conclusions as small as possible. This task is known to be hard in general but tractable for a number…
This is a next paper from a sequel devoted to algebraic aspects of Yang-Mills theory. We undertake a study of deformation theory of Yang-Mills algebra YM - a ``universal solution'' of Yang-Mills equation. We compute (cyclic) (co)homology of…
We describe an approach for finding upper bounds on an ODE dynamical system's maximal Lyapunov exponent among all trajectories in a specified set. A minimization problem is formulated whose infimum is equal to the maximal Lyapunov exponent,…
Generalized equations are problems emerging in contexts of modern variational analysis as an adequate formalism to treat such issues as constraint systems, optimality and equilibrium conditions, variational inequalities, differential…
One revisits the standard saddle-point method based on conjugate duality for solving convex minimization problems. Our aim is to reduce or remove unnecessary topological restrictions on the constraint set. Dual equalities and…
We continue our investigation of quark confinement using a particular variant of the Cho-Duan-Ge gauge independent Abelian decomposition. The decomposition splits the gauge field into a restricted Abelian part and a coloured part in a way…
Recently a class of supersymmetric gauge theories have been successfully implemented on the lattice. However, there has been an ongoing debate on whether lattice versions of some of these theories suffer from a sign problem, with…
In this work, we present a new efficient method for convex shape representation, which is regardless of the dimension of the concerned objects, using level-set approaches. Convexity prior is very useful for object completion in computer…
By introducing a more flexible notion of convexity, we obtain a new Omori-Yau maximum principle for harmonic maps. In the spirit of the Calabi-Yau conjectures, this principle is more suitable for studying the unboundedness of certain…
The article is devoted to the development of algorithmic methods ensuring efficient complexity bounds for strongly convex-concave saddle point problems in the case when one of the groups of variables is high-dimensional, and the other is…
The maximum-entropy sampling problem is a fundamental and challenging combinatorial-optimization problem, with application in spatial statistics. It asks to find a maximum-determinant order-$s$ principal submatrix of an order-$n$ covariance…
We develop the calculus of superforms as a tool for convex geometry. The formalism is applied to valuations on convex bodies, the Alexandrov-Fenchel inequalities and Monge- Amp\`ere equations on the boundary of convex bodies.
We study parametric double phase problems involving superlinear nonlinearities with a growth that need not necessarily be polynomial. Based on truncation and comparison methods the existence of two constant sign solutions is shown provided…
We consider the case with boundary of the classical Kazdan-Warner problem in dimension greater or equal than three, i.e. the prescription of scalar and boundary mean curvatures via conformal deformations of the metric. We deal in particular…
Given a minimal surface equipped with a generically finite map to an Abelian variety, we give an optimal bound on the canonical degree of a rational or an elliptic curve. As a corollary, we obtain the finiteness of rational and elliptic…
Solving a long-standing open question in convex geometry, we will show that typical convex surfaces contain points of infinite curvature in all tangent directions. To prove this, we use an easy curvature definition imitating the idea of…
In this paper we present a new algorithmic realization of a projection-based scheme for general convex constrained optimization problem. The general idea is to transform the original optimization problem to a sequence of feasibility…