Related papers: Zero Duality Gap in View of Abstract Convexity
Abstract separation systems provide a simple general framework in which both tree-shape and high cohesion of many combinatorial structures can be expressed, and their duality proved. Applications range from tangle-type duality and tree…
Motivated by the optimality principles for non-subdifferentiable optimization problems, we introduce new relative subdifferentials and examine some properties for relatively lower semicontinuous functions including $\epsilon$-regular…
In this paper, we analyze the mirror descent algorithm for non-smooth optimization problems in which the objective function is relatively strongly convex, without relying on the standard Lipschitz continuity assumption commonly used in the…
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…
We present a novel analysis of semidefinite programs (SDPs) with positive duality gaps, i.e. different optimal values in the primal and dual problems. These SDPs are extremely pathological, often unsolvable, and also serve as models of more…
Applying a general categorical construction for the extension of dualities, we present a new proof of the Fedorchuk duality between the category of compact Hausdorff spaces with their quasi-open mappings and the category of complete normal…
An antinorm is a concave nonnegative homogeneous functional on a convex cone. It is shown that if the cone is polyhedral, then every antinorm has a unique continuous extension from the interior of the cone. The main facts of the duality…
A new and extensive formalism is developed for monads and galaxies in non-standard enlargements. It is shown that monads and galaxies can be manipulated using order-preserving and order-reversing set-to-set maps, and that set properties…
The first part of this work established the foundations of a radial duality between nonnegative optimization problems, inspired by the work of (Renegar, 2016). Here we utilize our radial duality theory to design and analyze projection-free…
Recently the authors have explored new concepts of plurisubharmonicity and pseudoconvexity, with much of the attendant analysis, in the context of calibrated manifolds. Here a much broader extension is made. This development covers a wide…
In the paper new representations are obtained for duals and dual hulls of the classes of analytic functions. The Ruscheweyh duality principle is shown to hold under somewhat weaker assumptions. For a compact class of functions its subclass…
We consider the problem of minimizing a convex, separable, nonsmooth function subject to linear constraints. The numerical method we propose is a block-coordinate extension of the Chambolle-Pock primal-dual algorithm. We prove convergence…
Existence of solutions to doubly nonlinear equations in reflexive Banach spaces is established by resorting to a global-in-time variational approach inspired by De Giorgi's principle, which characterizes the associated flows as…
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.…
(Renegar, 2016) introduced a novel approach to transforming generic conic optimization problems into unconstrained, uniformly Lipschitz continuous minimization. We introduce {\it radial transformations} generalizing these ideas, equipped…
We investigate certain envelopes of open sets in dual Banach spaces which are related to extending holomorphic functions. We give a variety of examples of absolutely convex sets showing that the extension is in many cases not possible. We…
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…
Let $E$ be a uniformly smooth and uniformly convex real Banach space and $E^*$ be its dual space. Suppose $A : E\rightarrow E^*$ is bounded, strongly monotone and satisfies the range condition such that $A^{-1}(0)\neq \emptyset$. Inspired…
In this paper we study the concept of algebraic core for convex sets in general vector spaces without any topological structure and then present its applications to problems of convex analysis and optimization. Deriving the equivalence…
We introduce a notion of convexity with respect to a one-dimensional operator and with this notion find a one-parameter family of different convexities that interpolates between classical convexity and quasiconvexity. We show that, for this…