Related papers: On the Fenchel Duality between Strong Convexity an…

This note details how a recent structure theorem for normal $1$-currents proved by the first and third author allows to prove a conjecture of Cheeger concerning the structure of Lipschitz differentiability spaces. More precisely, we show…

We prove a general inequality for estimating the number of points of arbitrary complete intersections over a finite field. This extends a result of Deligne for nonsingular complete intersections. For normal complete intersections, this…

We introduce an unconditional concept of almost squareness in order to provide a partial negative answer to the problem of existence of any dual almost square Banach space. We also take advantage of this notion to provide some criterion of…

Non-convex functions that yet satisfy a condition of uniform convexity for non-close points can arise in discrete constructions. We prove that this sort of discrete uniform convexity is inherited by the convex envelope, which is the key to…

Considering the weighted concept of majorization, Sherman obtained generalization of majorization inequality for convex functions known as Sherman's inequality. We extend Sherman's result to the class of n-strongly convex functions using…

Given an nxn doubly stochastic matrix P satisfying an appropriate condition of linear algebraic-type, and a function f defined on a nonempty interval, we show that the validity of a convexity-type functional inequality for f in terms P…

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…

This paper analyzes the Lipschitz behavior of the feasible set in two parametric settings, associated with linear and convex systems in R^n. To start with, we deal with the parameter space of linear (finite/semi-infinite) systems identified…

In this paper, we mainly study subtransversality and two types of strong CHIP (given via Fr\'echet and limiting normal cones) for a collection of finitely many closed sets. We first prove characterizations of Asplund spaces in terms of…

We show that every regular graph with good local expansion has a spanning Lipschitz subgraph with large girth and minimum degree. In particular, this gives a finite analogue of the dynamical solution to the von Neumann problem by Gaboriau…

The class of $\mu$-compact sets can be considered as a natural extension of the class of compact metrizable subsets of locally convex spaces, to which the particular results well known for compact sets can be generalized. This class…

A purely analytic proof is given for an inequality that has as a direct consequence the two most important affine isoperimetric inequalities of plane convex geometry: The Blaschke-Santalo inequality and the affine isoperimetric inequality…

The (global) Lipschitz smoothness condition is crucial in establishing the convergence theory for most optimization methods. Unfortunately, most machine learning and signal processing problems are not Lipschitz smooth. This motivates us to…

The condition number of a differentiable convex function, namely the ratio of its smoothness to strong convexity constants, is closely tied to fundamental properties of the function. In particular, the condition number of a quadratic convex…

In this paper we classify the monomial complete intersection algebras, in two variables, and of positive characteristic, which has the strong Lef- schetz property. Together with known results, this gives a complete classi- fication of the…

We consider the sharp Sobolev-Poincar\'e constant for the embedding of $W^{1,2}_0(\Omega)$ into $L^q(\Omega)$. We show that such a constant exhibits an unexpected dual variational formulation, in the range $1<q<2$. Namely, this can be…

Differentiable structure ensures that many of the basics of classical convex analysis extend naturally from Euclidean space to Riemannian manifolds. Without such structure, however, extensions are more challenging. Nonetheless, in…

We first study Clarke's tangent cones at infinity to unbounded subsets of $\mathbb{R}^n.$ We prove that these cones are closed convex and show a characterization of their interiors. We then study subgradients at infinity for extended real…

In this paper, we prove that a strongly convex complex Finsler metric $F$ on a domain $D\subset\mathbb{C}^n$ is projectively flat (resp. dually flat) if and only if $F$ comes from a strongly convex complex Minkowski metric.

Let X_1 ,..., X_n be a collection of binary valued random variables and let f : {0,1}^n -> R be a Lipschitz function. Under a negative dependence hypothesis known as the {\em strong Rayleigh} condition, we show that f - E f satisfies a…