Related papers: Duality for the robust sum of functions
For equality-constrained linear mixed-integer programs (MIP) defined by rational data, it is known that the subadditive dual is a strong dual and that there exists an optimal solution of a particular form, termed generator subadditive…
The problem of finding the minimizer of a sum of convex functions is central to the field of distributed optimization. Thus, it is of interest to understand how that minimizer is related to the properties of the individual functions in the…
This paper studies the strong quasiconvexity of norm and distance functions in finite-dimensional normed spaces. Although the Euclidean norm is known to be strongly quasiconvex on bounded convex sets, a complete characterization of this…
A dynamical system is strongly robustly safe provided that it remains safe in the presence of a continuous and positive perturbation, named robustness margin, added to both the argument and the image of the right-hand side (the dynamics).…
For a family of weight functions invariant under a finite reflection group, the boundedness of a maximal function on the unit sphere is established and used to prove a multiplier theorem for the orthogonal expansions with respect to the…
We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…
We study dualities between classes of relational topological structures, given by Hom-functors. We show that there exists a 2-element structure with infinitely many relations, which reconstructs all other structures generated by a 2-element…
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…
Let $\mathcal{P}$ be the set of the primes. We consider a class of random multiplicative functions $f$ supported on the squarefree integers, such that $\{f(p)\}_{p\in\mathcal{P}}$ form a sequence of $\pm1$ valued independent random…
The presence of second-order smoothness for objective functions of optimization problems can provide valuable information about their stability properties and help us design efficient numerical algorithms for solving these problems. Such…
Determining functionals are tools to describe the finite dimensional long-term dynamics of infinite dimensional dynamical systems. There also exist several applications to infinite dimensional {\em random} dynamical systems. In these…
The density of polynomials in a weighted space of infinitely differentiable functions in a multidimensional real space is proved under minimal conditions on weight functions and on differences between weight functions. We apply this result…
Composite functions have been studied for over 40 years and appear in a wide range of optimization problems. Convex analysis of these functions focuses on (i) conditions for convexity of the function based on properties of its components,…
We prove various results in infinite-dimensional differential calculus which relate differentiability properties of functions and associated operator-valued functions (e.g., differentials). The results are applied in two areas: 1. in the…
Let $n\ge1$ and $B\ge2$. A real-valued function $f$ defined on the $n$-simplex $\Delta_n$ is approximately convex with respect to $\Delta_{B-1}$ iff f(\sum_{i=1}^B t_ix_i) \le \sum_{i=1}^B t_if(x_i) +1 for all $x_1,...,x_B \in \Delta_n$ and…
A family of tridiagonal pairs which appear in the context of quantum integrable systems is studied in details. The corresponding eigenvalue sequences, eigenspaces and the block tridiagonal structure of their matrix realizations with respect…
The notion of a firmly nonexpansive mapping is central in fixed point theory because of attractive convergence properties for iterates and the correspondence with maximal monotone operators due to Minty. In this paper, we systematically…
In this paper we discuss symmetrically self-dual spaces, which are simply real vector spaces with a symmetric bilinear form. Certain subsets of the space will be called q-positive, where q is the quadratic form induced by the original…
We consider a mathematical model for the classical Sudoku puzzle, which we call the primal problem and introduce a corresponding dual problem. Both problems are constraint satisfaction models and a duality relation between them is proved.…
In this work we derive a convex dual representation for increasing convex functionals on a space of real-valued Borel measurable functions defined on a countable product of metric spaces. Our main assumption is that the functionals fulfill…