Related papers: A Simple Proof of Nehari's Theorem Based on Dualit…

In this paper, we propose a general approach for explicit a posteriori error representation for convex minimization problems using basic convex duality relations. Exploiting discrete orthogonality relations in the space of element-wise…

We construct a convergent family of outer approximations for the problem of optimizing polynomial functions over convex bodies subject to polynomial constraints. This is achieved by generalizing the polarization hierarchy, which has…

We use supersymmetric localization and integration by parts to derive variational and convex correlation inequalities in statistical physics. As a primary application, we give an alternative proof of the monotonicity theorem for the…

We prove a Torelli-like theorem for higher-dimensional function fields, from the point of view of "almost-abelian" anabelian geometry.

For any $n\ge 2$, $\Omega\subset\rn$, and any given convex and coercive Hamiltonian function $H\in C^{0}(\rn)$, we find an optimal sufficient condition on $H$, that is, for any $c\in\mathbb R$, the level set $H^{-1}(c)$ does not contains…

We study geometric duality for convex vector optimization problems. For a primal problem with a $q$-dimensional objective space, we formulate a dual problem with a $(q+1)$-dimensional objective space. Consequently, different from an…

In this note we exhibit a very simple proof of McNaughton Theorem, almost right out of the definitions, and at the same time we observe that this theorem does not depend of Chang's completeness theorem.

This paper investigates the universal approximation capabilities of Hamiltonian Deep Neural Networks (HDNNs) that arise from the discretization of Hamiltonian Neural Ordinary Differential Equations. Recently, it has been shown that HDNNs…

Maximizing submodular objectives under constraints is a fundamental problem in machine learning and optimization. We study the maximization of a nonnegative, non-monotone $\gamma$-weakly DR-submodular function over a down-closed convex…

For a primal-dual pair of conic linear problems that are described by convex cones $S\subset X$, $T\subset Y$, bilinear symmetric objective functions $\langle\cdot,\cdot\rangle_X$, $\langle\cdot,\cdot\rangle_Y$ and a linear operator…

In this paper, we discuss the problem of minimizing the sum of two convex functions: a smooth function plus a non-smooth function. Further, the smooth part can be expressed by the average of a large number of smooth component functions, and…

We revisit the duality theorem for multimarginal optimal transportation problems. In particular, we focus on the Coulomb cost. We use a discrete approximation to prove equality of the extremal values and some careful estimates of the…

The classical problem of optimal transportation can be formulated as a linear optimization problem on a convex domain: among all joint measures with fixed marginals find the optimal one, where optimality is measured against a cost function.…

The aim of this article is to establish new two-functions minimax inequalities extending classical results such as Simons' minimax theorem. Our results will be proved in a non-compact setting. We also prove, under general conditions, that…

Approximation theory is concerned with the ability to approximate functions by simpler and more easily calculated functions. The first question we ask in approximation theory concerns the {\it possibility of approximation}. Is the given…

This note proves orbifold versions of Kobayashi's theorem. The main result asserts that a compact K\"ahler orbifold with non-negative Ricci curvature, along with certain conditions regarding singularities, is simply connected.

This paper proposes a general duality framework for the problem of minimizing a convex integral functional over a space of stochastic processes adapted to a given filtration. The framework unifies many well-known duality frameworks from…

In this paper we are concerned with a Gordan-type theorem involving an arbitrary number of inequality functions. We not only state its validity under a weak convexity assumption on the functions, but also show it is an optimal result. We…

We prove a relative version of the realization theorem for $h_\infty$-diagrams in case that the underlying diagram subcategory is factorization-closed.

Pseudo-holomorphic curves on almost complex manifolds have been much more intensely studied than their "dual" objects, the plurisubharmonic functions. These functions are defined classically by requiring that the restriction to each…