Related papers: What are Capra-Convex Sets?
Regularized empirical risk minimization with constrained labels (in contrast to fixed labels) is a remarkably general abstraction of learning. For common loss and regularization functions, this optimization problem assumes the form of a…
This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…
Pseudo-cones are a class of unbounded closed convex sets, not containing the origin. They admit a kind of polarity, called copolarity. With this, they can be considered as a counterpart to convex bodies containing the origin in the…
Convex support, the mean values of a set of random variables, is central in information theory and statistics. Equally central in quantum information theory are mean values of a set of observables in a finite-dimensional C*-algebra A, which…
A sequence $\textbf{p}=(p_{n})$ of real numbers is called Abel convergent to $\ell$ if the series $\Sigma_{k=0}^{\infty}p_{k}x^{k}$ is convergent for $0\leq x<1$ and \[\lim_{x \to 1^{-}}(1-x) \sum_{k=0}^{\infty}p_{k}x^{k}=\ell.\] We…
Deciding whether the union of two convex polyhedra is itself a convex polyhedron is a basic problem in polyhedral computations; having important applications in the field of constrained control and in the synthesis, analysis, verification…
Conventional principal component analysis (PCA) finds a principal vector that maximizes the sum of second powers of principal components. We consider a generalized PCA that aims at maximizing the sum of an arbitrary convex function of…
In this paper we present two Fenchel-type dual problems for a DC (difference of convex functions) optimization primal one. They have been built by means of the c-conjugation scheme, a pattern of conjugation which has been shown to be…
We consider a class of non-conjugate priors as a mixing family of distributions for a parameter (e.g., Poisson or gamma rate, inverse scale or precision of an inverse-gamma, inverse variance of a normal distribution) of an exponential…
In this paper, we introduce the concept of relative convex sequences and establish their fundamental properties, highlighting their similarities to those of convex sequences. Additionally, we prove new inequalities of the Lupas and…
Sparse estimation methods are aimed at using or obtaining parsimonious representations of data or models. While naturally cast as a combinatorial optimization problem, variable or feature selection admits a convex relaxation through the…
This paper deals with the characterization, in terms of closedness of certain sets regarding other sets, of Farkas lemmas determining when the upperlevel set of a given convex function contains the intersection, say F, of a convex set of a…
Let n be a positive integer and c an n-tuple of natural numbers. A convex set in Euclidean n-space given by a family of linear relations in the elements of c and depending on their natural order is defined. The extremal elements of this…
This paper introduces a new subtraction operation for convex sets, which defines their difference as a collection of inclusion-minimal convex sets with appropriate definitions of linear operations on them. With these operations the set of…
The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…
Motivated by the direct method in the calculus of variations in $L^{\infty}$, our main result identifies the notion of convexity characterizing the weakly$^*$ lower semicontinuity of nonlocal supremal functionals: Cartesian level convexity.…
The classical perspective of a function is a construction which transforms a convex function into one that is jointly convex with respect to an auxiliary scaling variable. Motivated by applications in several areas of applied analysis, we…
In this paper we study a class of convex sets which are called closed pseudo-cones and study a new duality of this class. It turns out that the duality characterizes closed pseudo-cones and is essentially the only possible abstract duality…
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…
While intersections of convex sets are convex, their unions have rather complicated behavior. Some natural contexts where they appear include duality arguments involving boundaries of convex sets and valuations, which have an Euler…