Related papers: Generalized Differentiation and Duality in Infinit…
Duality principle for approximation of geometrical objects (also known as Eudoxus exhaustion method) was extended and perfected by Archimedes in his famous tractate "Measurement of circle". The main idea of the approximation method by…
In this note we explore duality in reverse convex optimization with reverse convex inequality constraints. While we are examining the special case of a finite index set of the inequality constraints, we are primarily interested in the…
Examples of differentiable mappings into real or complex topological vector spaces with specific properties are given, which illustrate the differences between differential calculus in the locally convex and the non-locally convex case. In…
In this note we provide a full conjugacy and subdifferential calculus for convex convex-composite functions in finite-dimensional space. Our approach, based on infimal convolution and cone-convexity, is straightforward and yields the…
In the previous author's paper the Macdonald norm conjecture (including the famous constant term conjecture) was proved. This paper contains the proof of the remaining two (the duality and evaluation conjectures). The evaluation theorem is…
In this paper we study local cohomology of finitely generated bigraded modules over a standard bigraded ring with respect to the irrelevant bigraded ideals and establish a duality theorem. Several applications are considered.
We show that a broad range of convex optimization algorithms, including alternating projection, operator splitting, and multiplier methods, can be systematically derived from the framework of subspace correction methods via convex duality.…
This paper focuses on investigating generalized relative interior notions for sets in locally convex topological vector spaces with particular attentions to graphs of set-valued mappings and epigraphs of extended-real-valued functions. We…
As it was shown in the first part of this paper, there exists a duality between the category DSkeLC (introduced there) and the category SkeLC of locally compact Hausdorff spaces and continuous skeletal maps. We describe here the…
Consider a polyhedral convex cone which is given by a finite number of linear inequalities. We investigate the problem to project this cone into a subspace and show that this problem is closely related to linear vector optimization: We…
We consider the differentiation of the value function for parametric optimization problems. Such problems are ubiquitous in Machine Learning applications such as structured support vector machines, matrix factorization and min-min or…
In this paper, we employ the concept of quasi-relative interior to analyze the method of Lagrange multipliers and establish strong Lagrangian duality for nonsmooth convex optimization problems in Hilbert spaces. Then, we generalize the…
This article studies convex duality in stochastic optimization over finite discrete-time. The first part of the paper gives general conditions that yield explicit expressions for the dual objective in many applications in operations…
We extend the notion of polar duality to pairs of transverse Lagrangian planes in the standard symplectic space. This allows us to show that polar duality has a natural interpretation in terms of symplectic geometry. We apply our results to…
We generalize a result of Freedman and He, concerning the duality of moduli and capacities in solid tori, to sufficiently regular metric spaces. This is a continuation of the work of the author and K. Rajala on the corresponding duality in…
In this survey, we explain a version of topological $L^2$-Serre duality for singular complex spaces with arbitrary singularities. This duality can be used to deduce various $L^2$-vanishing theorems for the $\overline\partial$-equation on…
We develop a duality theory of locally recoverable codes (LRCs) and apply it to establish a series of new bounds on their parameters. We introduce and study a refined notion of weight distribution that captures the code's locality. Using a…
The paper is dedicated to the study of strong duality for a problem of linear copositive programming. Based on the recently introduced concept of the set of normalized immobile indices, an extended dual problem is deduced. The dual problem…
It is important to design separation algorithms of low computational complexity in mixed integer programming. We study the separation problems of the two continuous knapsack polyhedra with divisible capacities. The two polyhedra are the…
We study modules over the ring $\widetilde{\C}$ of complex generalized numbers from a topological point of view, introducing the notions of $\widetilde{\C}$-linear topology and locally convex $\widetilde{\C}$-linear topology. In this…