Related papers: Relative Convexity and Its Applications
We study versions of Helly's theorem that guarantee that the intersection of a family of convex sets in $R^d$ has a large diameter. This includes colourful, fractional and $(p,q)$ versions of Helly's theorem. In particular, the fractional…
During the study of the topic of limit summability of functions (introduced by the author in 2001), we encountered some types of functions that are related to the mean value theorem. In this paper, we formally define mean value and…
Uncertainty is prevalent in engineering design, data-driven problems, and decision making broadly. Due to inherent risk-averseness and ambiguity about assumptions, it is common to address uncertainty by formulating and solving conservative…
We prove the bulk universality of the $\beta$-ensembles with non-convex regular analytic potentials for any $\beta>0$. This removes the convexity assumption appeared in our earlier work. The convexity condition enabled us to use the…
We introduce and study the notion of (e,y)-conjugate for a proper and e-convex function in locally convex spaces, which is an extension of the concept of the conjugate. The mutual relationships between the concepts of (e,y)-conjugacy and…
In this paper we develop tools for studying limit theorems by means of convexity. We establish bounds for the discrepancy in total variation between probability measures $\mu$ and $\nu$ such that $\nu$ is log-concave with respect to $\mu$.…
We describe general heuristics to approximately solve a wide variety of problems with convex objective and decision variables from a nonconvex set. The heuristics, which employ convex relaxations, convex restrictions, local neighbor search…
We analyze the Schwarz inequality and its generalizations, as well as inequalities resulting from the Jensen inequality. They are used in quantum theory to derive the Heisenberg-Robertson (HR) and Schroedinger-Robertson (SR) uncertainty…
Matrix versions of some basic convexity inequalities are given. Further results on the same topic are proved in the recent papers on arxiv: 1. Hermitian operators and convex functions, 2. A concavity inequality for symmetric norms, 3.…
We characterize when a convex risk measure associated to a law-invariant acceptance set in $L^\infty$ can be extended to $L^p$, $1\leq p<\infty$, preserving finiteness and continuity. This problem is strongly connected to the statistical…
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…
A recent article Li and Lv considered contraction of convex hypersurfaces by certain nonhomogeneous functions of curvature, showing convergence to points in finite time in certain cases where the speed is a function of a degree-one…
This work is concerned with linear inverse problems where a distributed parameter is known a priori to only take on values from a given discrete set. This property can be promoted in Tikhonov regularization with the aid of a suitable convex…
Yager[5] proposed a transformation for opposing(negating) the occurence of an event that is not certain using the idea that one can oppose the occurence of any uncertain event by allocating its probability among the other outcomes in the…
In this paper, we establish some new inequalities for class of SX(h,I) convex functions which are supermultiplicative or superadditive and nonnegative. And we also give some applications for special means.
Many practical optimization problems lack strong convexity. Fortunately, recent studies have revealed that first-order algorithms also enjoy linear convergences under various weaker regularity conditions. While the relationship among…
Several optimization schemes have been known for convex optimization problems. However, numerical algorithms for solving nonconvex optimization problems are still underdeveloped. A progress to go beyond convexity was made by considering the…
In this paper we study the regularity of the local minima of integral functionals: in particular, not convexity (quasi-convexity, policonvexity or rank one convexity) hypothesis will be made on the density, neither structure hypothesis nor…
This paper addresses Tikhonov like regularization methods with convex penalty functionals for solving nonlinear ill-posed operator equations formulated in Banach or, more general, topological spaces. We present an approach for proving…
Majorization-minimization algorithms consist of successively minimizing a sequence of upper bounds of the objective function so that along the iterations the objective function decreases. Such a simple principle allows to solve a large…