相关论文: Level sets and non Gaussian integrals of positivel…

Consider the sub level set K := {x : g(x) $\le$ 1} where g is a positive and homogeneous polynomial. We show that its Lebesgue volume can be approximated as closely as desired by solving a sequence of generalized eigenvalue problems with…

Let $\mathcal{C}_{d,n}$ be the convex cone consisting of real $n$-variate degree $d$ forms that are strictly positive on $\mathbb{R}^n\setminus \{\mathbf{0}\}$. We prove that the Lebesgue volume of the sublevel set $\{g\leq 1\}$ of $g\in…

We address the following generalization $P$ of the Lowner-John ellipsoid problem. Given a (non necessarily convex) compact set $K\subset R^n$ and an even integer $d$, find an homogeneous polynomial $g$ of degree $d$ such that $K\subset…

Intrinsic volumes are fundamental geometric invariants generalizing volume, surface area, and mean width for convex bodies. We establish a unified Laplace-Grassmannian representation for intrinsic and dual volumes of convex polynomial…

We consider nonconvex real valued functions whose truncations are either quasiconvex or even convex starting with a certain level. Among them, the $C^2$-smooth functions whose level sets are all completely contained in the positive definite…

Lasserre [La] proved that for every compact set $K\subset\mathbb R^n$ and every even number $d$ there exists a unique homogeneous polynomial $g_0$ of degree $d$ with $K\subset G_1(g_0)=\{x\in\mathbb R^n:g_0(x)\leq 1\}$ minimizing $|G_1(g)|$…

The nonzero level sets of a homogeneous, logarithmically homogeneous, or translationally homogeneous function are affine spheres if and only if the Hessian determinant of the function is a multiple of a power or an exponential of the…

Carbery proved that if $u:\mathbb{R}^n \rightarrow \mathbb{R}$ is a positive, strictly convex function satisfying $\det D^2u \geq 1$, then we have the estimate $$ \left| \left\{x \in \mathbb{R}^n: u(x) \leq s \right\} \right| \lesssim_n…

The g-convexity of functions on manifolds is a generalization of the convexity of functions on Rn. It plays an essential role in both differential geometry and non-convex optimization theory. This paper is concerned with g-convex smooth…

In this paper we show the following result: if C is an n-dimensional 0-symmetric convex compact set, $f:C\rightarrow[0,1)$ is concave, and $g:[0,1)\rightarrow[0,1)$ is not identically zero, convex, with g(0)=0, then \[ \frac{1}{|C|}\int_C…

In this paper we construct explicit examples that show the sublevel sets of the solution of a $k$-Hessian equation defined on a convex ring do not have to be convex.

This paper concerns matrix "convex" functions of (free) noncommuting variables, $x = (x_1, \ldots, x_g)$. Helton and McCullough showed that a polynomial in $x$ which is matrix convex is of degree two or less. We prove a more general result:…

In this article we show the following result: if $C$ is an $n$-dimensional convex and compact subset, $f:C\rightarrow[0,\infty)$ is concave, and $\phi:[0,\infty)\rightarrow[0,\infty)$ is a convex function with $\phi(0)=0$, we then…

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

We study constrained nonconvex optimization problems in machine learning, signal processing, and stochastic control. It is well-known that these problems can be rewritten to a minimax problem in a Lagrangian form. However, due to the lack…

This note deals with certain properties of convex functions. We provide results on the convexity of the set of minima of these functions, the behaviour of their subgradient set under restriction, and optimization of these functions over an…

We consider the problem of approximating a semialgebraic set with a sublevel-set of a polynomial function. In this setting, it is standard to seek a minimum volume outer approximation and/or maximum volume inner approximation. As there is…

Bi-level optimization model is able to capture a wide range of complex learning tasks with practical interest. Due to the witnessed efficiency in solving bi-level programs, gradient-based methods have gained popularity in the machine…

In this paper, we discuss the problem of minimizing the sum of two convex functions: a smooth function plus a non-smooth function. Further, the smooth part can be expressed by the average of a large number of smooth component functions, and…

We consider the well-travelled problem of homogenization of random integral functionals. When the integrand has standard growth conditions, the qualitative theory is well-understood. When it comes to unbounded functionals, that is, when the…