相关论文: Convex-compactness and its applications

Approximations of optimization problems arise in computational procedures and sensitivity analysis. The resulting effect on solutions can be significant, with even small approximations of components of a problem translating into large…

Many star bodies have convex subsets with approximately the same Gaussian measure (of the complement). Inspired by this phenomenon, and in connection with the randomized Dvoretzky theorem for Lorentz spaces, we derive bounds on the…

Given a subset $A\times B$ of a locally convex space $X\times Y$ (with $A$ compact) and a function $f:A\times B\rightarrow\overline{\mathbb{R}}$ such that $f(\cdot,y),$ $y\in B,$ are concave and upper semicontinuous, the minimax inequality…

Consider a convex function that is invariant under an group of transformations. If it has a minimizer, does it also have an invariant minimizer? Variants of this problem appear in nonparametric statistics and in a number of adjacent fields.…

A new version of the Hadwiger theorem on convex functions is established and an explicit representation of functional intrinsic volumes is found using new functional Cauchy-Kubota formulas. In addition, connections between functional…

A pair of subsets of Euclidean space which nearly achieves equality in the Brunn-Minkowski inequality must nearly coincide with a pair of homothetic convex sets. The two-dimensional case was treated in a previous paper in this series by an…

This paper presents new approaches to the fixed point property for nonexpansive mappings in L^1 spaces. While it is well-known that L^1 fails the fixed point property in general, we provide a complete and self-contained proof that…

Building on and extending tools from variational analysis, we prove Kuratowski convergence of sets of simplicial area minimizers to minimizers of the smooth Douglas-Plateau problem under simplicial refinement. This convergence is with…

In this paper we obtain a generalization of Matkowski's fixed point theorem and Istratescu's fixed point theorem concerning convex contractions in the framework of b-metric spaces. By providing appropriate examples we show that the above…

We study the convergence properties of the 'greedy' Frank-Wolfe algorithm with a unit step size, for a convex maximization problem over a compact set. We assume the function satisfies smoothness and strong convexity. These assumptions…

We review several (and provide new) results on the theory of moments, sums of squares and basic semi-algebraic sets when convexity is present. In particular, we show that under convexity, the hierarchy of semidefinite relaxations for…

We study the optimization of (strongly) quasar-convex functions, a class that arises naturally in many machine learning and data science applications due to its favorable properties. The fundamental properties of this class are first…

The first author introduced a measure of compactness for families of sets, relative to a class of filters, in the context of convergence approach spaces. We characterize a variety of maps (types of quotient maps, closed maps, and variants…

In this paper, we propose a new Fully Composite Formulation of convex optimization problems. It includes, as a particular case, the problems with functional constraints, max-type minimization problems, and problems of Composite…

Recently there were proposed some innovative convex optimization concepts, namely, relative smoothness [1] and relative strong convexity [2,3]. These approaches have significantly expanded the class of applicability of gradient-type methods…

In the present paper, the following convexity principle is proved: any closed convex multifunction, which is metrically regular in a certain uniform sense near a given point, carries small balls centered at that point to convex sets, even…

Understanding the topology of sublevel sets yields crucial insights into the optimization landscape of non-convex functions. If sublevel sets are connected, local search algorithms are less likely to be trapped in isolated valleys,…

This paper gives two different proofs to a structural theorem of decreasing minimization (lexicographic optimization) on integrally convex sets. The theorem states that the set of decreasingly minimal elements of an integrally convex set…

We introduce a new covering property, defined in terms of order types of sequences of open sets, rather than in terms of cardinalities of families. The most general form of this compactness notion depends on two ordinal parameters. In the…

In optimal control theory the expression infimum gap means a strictly negative difference between the infimum value of a given minimum problem and the infimum value of a new problem obtained by the former by extending the original family V…