Related papers: Duality for Delsarte's extremal problem on locally…
This paper derives a discrete dual problem for a prototypical hybrid high-order method for convex minimization problems. The discrete primal and dual problem satisfy a weak convex duality that leads to a priori error estimates with…
Consider the problem {ll} \Delta^2 u= \lambda e^{u} &\text{in} B u=\frac{\partial u}{\partial n}=0 &\text{on}\partial B, where $B$ is the unit ball in $\R^N$ and $\lambda$ is a parameter. Unlike the Gelfand problem the natural candidate…
Calibration and uncertainty estimation are crucial topics in high-risk environments. We introduce a new diversity regularizer for classification tasks that uses out-of-distribution samples and increases the overall accuracy, calibration and…
We consider an effective theory of massive scalar fields on a fixed AdS$_{d+1}$ background with a cubic extremal interaction among them. A bulk coupling is called extremal whenever the corresponding conformal dimension of any of the dual…
In this paper we explore the role of duality principles within the problem of rotation averaging, a fundamental task in a wide range of computer vision applications. In its conventional form, rotation averaging is stated as a minimization…
The notion of formal duality in finite Abelian groups appeared recently in relation to spherical designs, tight sphere packings, and energy minimizing configurations in Euclidean spaces. For finite cyclic groups it is conjectured that there…
Many algorithms in verification and automated reasoning leverage some form of duality between proofs and refutations or counterexamples. In most cases, duality is only used as an intuition that helps in understanding the algorithms and is…
We show that sparsity constrained optimization problems over low dimensional spaces tend to have a small duality gap. We use the Shapley-Folkman theorem to derive both data-driven bounds on the duality gap, and an efficient primalization…
In a former paper we introduced the concept of localisation of ideals in the Fourier algebra of a locally compact Abelian group. It turns out that localisability of a closed ideal in the Fourier algebra is equivalent to the synthesisability…
The canonical duality theory has provided with a unified analytic solution to a range of discrete and continuous problems in global optimization, which can transform a nonconvex primal problem to a concave maximization dual problem over a…
A universal system of difference equations associated with a hyperelliptic curve is derived constituting the discrete analogue of the Dubrovin equations arising in the theory of finite-gap integration. The parametrisation of the solutions…
Let $G$ be a locally compact abelian topological group. For locally bounded measurable functions $\varphi: G\to\Bbb {C}$ we discuss notions of spectra for $\varphi$ relative to subalgebras of $L^{1}(G)$. In particular we study polynomials…
The 'exact subgraph' approach was recently introduced as a hierarchical scheme to get increasingly tight semidefinite programming relaxations of several NP-hard graph optimization problems. Solving these relaxations is a computational…
The extremal functional method determines approximate solutions to the constraints of crossing symmetry, which saturate bounds on the space of unitary CFTs. We show that such solutions are characterized by extremality conditions, which may…
We consider an optimization problem with positively homogeneous functions in its objective and constraint functions. Examples of such positively homogeneous functions include the absolute value function and the $p$-norm function, where $p$…
Binary optimization, a representative subclass of discrete optimization, plays an important role in mathematical optimization and has various applications in computer vision and machine learning. Usually, binary optimization problems are…
The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…
A duality theorem for the stable module category of representations of a finite group scheme is proved. One of its consequences is an analogue of Serre duality, and the existence of Auslander-Reiten triangles for the $\mathfrak{p}$-local…
Proximal operators with affine constraints arise in numerous models in nonconvex projection, composite optimization, and structured regularization. However, their efficient computation remains challenging due to the simultaneous presence of…
Although much research has been devoted to extremal problems on non-overlapping domains little is known about all solutions of this problems. We generalized some of this problems on the case of more general systems of points. It was solved…