Related papers: Generalized Differentiation and Duality in Infinit…
We provide a pointwise bipolar theorem for liminf-closed convex sets of positive Borel measurable functions on a sigma-compact metric space without the assumption that the polar is a tight set of measures. As applications we derive a…
Lorentz covariant generalisations of the notions of supersymmetry, superspace and self-duality are discussed. The essential idea is to extend standard constructions by allowing tangent vectors and coordinates which transform according to…
We present examples of Lax-integrable multi-dimensional systems of partial differential equations with higher local symmetries. We also consider Lagrangian deformations of these equations and construct variational bivectors on them.
On metric spaces equipped with doubling measures, we prove that a differentiability theorem holds for Lipschitz functions if and only if the space supports nontrivial (metric) derivations in the sense of Weaver that satisfy an additional…
Some properties of generalized convexity for sets and for functions are identified in case of the reliability polynomials of two dual minimal networks. A method of approximating the reliability polynomials of two dual minimal network is…
The Connes formula giving the dual description for the distance between points of a Riemannian manifold is extended to the Lorentzian case. It resulted that its validity essentially depends on the global structure of spacetime. The duality…
It is well-known that the convex and concave envelope of a multilinear polynomial over a box are polyhedral functions. Exponential-sized extended and projected formulations for these envelopes are also known. We consider the convexification…
This note establishes a limiting formula for the conic Lagrangian dual of a convex infinite optimization problem, correcting the classical version of Karney [Math. Programming 27 (1983) 75-82] for convex semi-infinite programs. A…
This work is devoted to a vast extension of Sanov's theorem, in Laplace principle form, based on alternatives to the classical convex dual pair of relative entropy and cumulant generating functional. The abstract results give rise to a…
A convex duality result for martingale optimal transport problems with two marginals was established in Beiglb\"ock et al. (2013). In this paper we provide a generalization of this result to the multi-period setting.
This study focuses on defining normal and strictly convex structures within Menger cone PM-space. It also presents a shared fixed point theorem for the existence of two self-mappings constructed on a strictly convex probabilistic cone…
Relative smoothness and strong convexity have recently gained considerable attention in optimization. These notions are generalizations of the classical Euclidean notions of smoothness and strong convexity that are known to be dual to each…
We consider the convex bilevel optimization problem, also known as simple bilevel programming. There are two challenges in solving convex bilevel optimization problems. Firstly, strong duality is not guaranteed due to the lack of Slater…
It is explained how a locally convex (lc) topology $\tau$ on a real vector space $V$ extends to a locally multiplicatively convex (lmc) topology $\overline{\tau}$ on the symmetric algebra $S(V)$. This allows the application of the results…
We use linear Koszul duality, a geometric version of the standard duality between modules over symmetric and exterior algebras studied in previous papers of the authors to give a geometric realization of the Iwahori-Matsumoto involution of…
A detailed study of the notions of convexity for a hypersurface in a Finsler manifold is carried out. In particular, the infinitesimal and local notions of convexity are shown to be equivalent. Our approach differs from Bishop's one in his…
Even after over two decades, the total variation (TV) remains one of the most popular regularizations for image processing problems and has sparked a tremendous amount of research, particularly to move from scalar to vector-valued…
This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…
The main problem considered in the present paper is to single out classes of convex sets, whose convexity property is preserved under nonlinear smooth transformations. Extending an approach due to B.T. Polyak, the present study focusses on…
This article studies problems of optimal transport, by embedding them in a general functional analytic framework of convex optimization. This provides a unified treatment of a large class of related problems in probability theory and allows…