Related papers: Extremality of Convex Sets with Some Applications

Convexity, though extremely important in mathematical programming, has not drawn enough attention in the field of dynamic programming. This paper gives conditions for verifying convexity of the cost-to-go functions, and introduces an…

We introduce a new operation, copolar addition, on unbounded convex subsets of the positive orthant of real euclidean space and establish convexity of the covolumes of the corresponding convex combinations. The proof is based on a technique…

In this paper, we investigate the concept of p-convexity for sets and functions in n-dimensional Euclidean space. We establish novel algebraic and topological results within this generalized convexity framework. Furthermore, we analyze…

This paper consists of four general parts: convex sets; convex functions; convex optimization; and the interior-point algorithm. I will start by introducing the definition of convex sets and give three common convex set examples which will…

Extremal length is a conformal invariant that transfers naturally to the discrete setting, giving square tilings as a natural combinatorial analog of conformal mappings. Recent work by S. Hersonsky has explored generalizing these ideas to…

A new notion of face relative interior for convex sets in topological real vector spaces is introduced in this work. Face relative interior is grounded in the facial structure, and may capture the geometry of convex sets in topological…

We establish how a higher local field can be described as a locally convex vector space once an embedding of a local field into it has been fixed. This extends previous results that had been obtained in the two-dimensional case. In…

We develop a functional extension of an extremal principle by Schneider (Monatsh. Math., 1967) by introducing generalized outer linearizations of convex functions. Given a coercive convex function on $\mathbb{R}^n$, a generalized outer…

Although much research has been devoted to extremal problems on non-overlapping domains little is known about all solutions of this problems. We generalized some of this problems on the case of more general systems of points. It was solved…

Region-specific linear models are widely used in practical applications because of their non-linear but highly interpretable model representations. One of the key challenges in their use is non-convexity in simultaneous optimization of…

A unifying framework for some extremal problems on locally compact Abelian groups is considered, special cases of which include the Delsarte and Tur\'an extremal problems. A slight variation of the extremal problem is introduced and the…

In this paper we give an improved upper bound, as compared to the one given in [3] for the number of extreme points of the convex set of all G-invariant probability measures on X*Y with given marginals of full support.

Let $R$ be a polynomial ring over a field. We describe the extremal rays and the facets of the cone of local cohomology tables of finitely generated graded $R$-modules of dimension at most two. Moreover, we show that any point inside the…

We study the smoothness of the Siciak-Zaharjuta extremal function associated to a convex body in $\mathbb{R}^2$. We also prove a formula relating the complex equilibrium measure of a convex body in $\mathbb{R}^n$ to that of its Robin…

We prove for the first time that, if a linear inverse problem exhibits a group symmetry structure, gradient-based optimizers can be designed to exploit this structure for faster convergence rates. This theoretical finding demonstrates the…

We consider a definition of a weakly convex set which is a generalization of the notion of a weakly convex set in the sense of Vial and a proximally smooth set in the sense of Clarke, from the case of the Hilbert space to a class of Banach…

This paper considers the problem of smoothing convex functions and sets, seeking the nearest smooth convex function or set to a given one. For convex cones and sublinear functions, a full characterization of the set of all optimal…

Functions with uniform level sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used, e.g., in multicriteria optimization, decision theory, mathematical…

In the framework of shape constrained estimation, we review methods and works done in convex set estimation. These methods mostly build on stochastic and convex geometry, empirical process theory, functional analysis, linear programming,…

In this article, we prove the existence of extremal functions in higher-order affine Sobolev inequalities. Proofs rely on concentration-compactness methods in spaces of integer or fractional regularity. The tools we use, available in spaces…