Related papers: Polyconvex double well functions
Given a non-hermitean matrix M, the structure of its minimal polynomial encodes whether M is diagonalizable or not. This note will explain how to determine the minimal polynomial of a matrix without going through its characteristic…
Consider a differentiable convex function $f: \mathbb{R}^n \supset \mathrm{dom} f \rightarrow \mathbb{R}.$ The induced spectral function $F$ is given by $F=f \circ \lambda,$ where $\lambda: \mathbf{M}_n^{sa} \rightarrow \mathbb{R}^{n}$ is…
The question how to certify non-negativity of a polynomial function lies at the heart of Real Algebra and also has important applications to Optimization. In this article we investigate the question of non-negativity in the context of…
We apply upper and lower compensated convex transforms, which are `tight' one-sided approximations of a given function, to the extraction of fine geometric singularities from semiconvex/semiconcave functions and DC-functions in…
We establish a maximum principle for a two-point function in order to analyze the convexity of level sets of harmonic functions. We show that this can be used to prove a strict convexity result involving the smallest principal curvature of…
Given a piecewise linear (PL) function $p$ defined on an open subset of $\R^n$, one may construct by elementary means a unique polyhedron with multiplicities $\D(p)$ in the cotangent bundle $\R^n\times \R^{n*}$ representing the graph of the…
This paper deals with constrained convex problems, where the objective function is smooth strongly convex and the feasible set is given as the intersection of a large number of closed convex (possibly non-polyhedral) sets. In order to deal…
We establish a Fenchel-Moreau type theorem for proper convex functions $f\colon X\to \bar{L}^0$, where $(X, Y, \langle \cdot,\cdot \rangle)$ is a dual pair of Banach spaces and $\bar L^0$ is the space of all extended real-valued functions…
In our previous paper [SIMAX 31 n.3 1491-1506(2010)], we studied the condition metric in the space of maximal rank matrices. Here, we show that this condition metric induces a Lipschitz-Riemann structure on that space. After investigating…
The special case of the hypergeometric function $_{2}F_{1}$ represents the binomial series $(1+x)^{\alpha}=\sum_{n=0}^{\infty}(\:\alpha n\:)x^{n}$ that always converges when $|x|<1$. Convergence of the series at the endpoints, $x=\pm 1$,…
Submodular Functions are a special class of set functions, which generalize several information-theoretic quantities such as entropy and mutual information [1]. Submodular functions have subgradients and subdifferentials [2] and admit…
A min-max formula is proved for the minimum of an integer-valued separable discrete convex function where the minimum is taken over the set of integral elements of a box total dual integral (box-TDI) polyhedron. One variant of the theorem…
Let $\Rx$ denote the ring of polynomials in $g$ freely non-commuting variables $x=(x_1,...,x_g)$. There is a natural involution * on $\Rx$ determined by $x_j^*=x_j$ and $(pq)^*=q^* p^*$ and a free polynomial $p\in\Rx$ is symmetric if it is…
We show that certain determinantal functions of multiple matrices, when summed over the symmetries of the cube, decompose into functions of the original matrices. These are shown to be true in complete generality; that is, no properties of…
Motivated by the well-known implications among $t$-convexity properties of real functions, analogous relations among the upper and lower $M$-convexity properties of real functions are established. More precisely, having an $n$-tuple…
Assume that $f$ is Dunkl polyharmonic in $\mathbb{R}^n$ (i.e. $(\Delta_h)^p f=0$ for some integer $p$, where $\Delta_h$ is the Dunkl Laplacian associated to a root system $R$ and to a multiplicity function $\kappa$, defined on $R$ and…
In this paper we introduce and study the notion of plurisubharmonic functions in calibrated geometry. These functions generalize the classical plurisubharmonic functions from complex geometry and enjoy many of their important properties.…
A pointed convex cone naturally induces a partial order, and further a notion of nondecreasingness for functions. We consider extended real-valued functions defined on the cone. Monotone conjugates for these functions can be defined in an…
We prove an f-version of Mirsky's singular value inequalities for differences of matrices. This f-version consists in applying a positive concave function f, with f(0)=0, to every singular value in the original Mirsky inequalities.
Convergence rates results for variational regularization methods typically assume the regularization functional to be convex. While this assumption is natural for scalar-valued functions, it can be unnecessarily strong for vector-valued…