Separable sublinear functions are used to provide upper bounds on the recourse function of a stochastic program. The resulting problem's objective involves the inf-convolution of convex functions. A dual of this problem is formulated to obtain an implementable procedure to calculate the bound. Function evaluations for the resulting convex program only require a small number of single integratio...

The concept of neighbor system, introduced by Hartvigsen (2009), is a set of integral vectors satisfying a certain combinatorial property. In this paper, we reveal the relationship of neighbor systems with jump systems and with bisubmodular polyhedra. We firstly prove that for every neighbor system, there exists a jump system which has the same neighborhood structure as the original neighbor sy...

Let Ω be the upper half plane {(x, y) ∈ R, x > 0, y ∈ R}. Define the Laplacian on Ω to be ∆D = ∂ 2 x + (1 + x)∂ 2 y , together with Dirichlet boundary conditions on ∂Ω: one may easily see that Ω, with the metric inherited from ∆D, is a strictly convex domain. We shall prove that, in such a domain Ω, Strichartz estimates for the wave equation suffer losses when compared to the usual case Ω = R, ...

For functions defined on integer lattice points, discrete versions of the Hessian matrix have been considered in various contexts. In discrete convex analysis, for example, certain combinatorial properties of the discrete Hessian matrices are known to characterize M-convex and L-convex functions, which can be extended to convex functions in real variables. The relationship between convex extens...

A restricted-orientation convex set, also called an O-convex set, is a set of points whose intersection with lines from some fixed set is empty or connected. The notion of O-convexity generalizes standard convexity and orthogonal convexity. We explore some of the basic properties of O-convex sets in two and higher dimensions. We also study O-connected sets, which are a subclass of O-convex sets...

We consider a class of integer-valued discrete convex functions, called BS-convex functions, defined on integer lattices whose affinity domains are sets of integral points of integral bisubmodular polyhedra. We examine discrete structures of BSconvex functions and give a characterization of BS-convex functions in terms of their convex conjugate functions by means of (discordant) Freudenthal sim...

Let Ω ⊆ Rn be a strictly convex domain and let φ ∈ C2(Ω) be a convex function such that λ ≤ detD2φ ≤ Λ in Ω. The linearized Monge– Ampère equation is LΦu = trace(ΦD u) = f, where Φ = (detD2φ)(D2φ)−1 is the matrix of cofactors of D2φ. We prove that there exist p > 0 and C > 0 depending only on n, λ,Λ, and dist(Ω′,Ω) such that ‖Du‖Lp(Ω′) ≤ C(‖u‖L∞(Ω) + ‖f‖Ln(Ω)) for all solutions u ∈ C2(Ω) to the...

‎In this paper‎, ‎first we study the weak and strong convergence of solutions to the‎ ‎following first order nonhomogeneous gradient system‎ ‎$$begin{cases}-x'(t)=nablaphi(x(t))+f(t), text{a.e. on} (0,infty)\‎‎x(0)=x_0in Hend{cases}$$ to a critical point of $phi$‎, ‎where‎ ‎$phi$ is a $C^1$ quasi-convex function on a real Hilbert space‎ ‎$H$ with ${rm Argmin}phineqvarnothing$ and $fin L^1(0...

Tom Richmond* ([email protected]). Complementation in the Lattice of Locally Convex Topologies. We find all locally convex homogeneous topologies on (R,≤) and determine which of these have locally convex complements. Among the locally convex topologies on a n-point totally ordered set, each has a locally convex complement, and at least n of them have 2n−1 locally convex complements. For any ...

The convex dimension of a graph G = (V, E) is the smallest dimension d for which G admits an injective map f : V −→ R of its vertices into d-space, such that the barycenters of the images of the edges of G are in convex position. The strong convex dimension of G is the smallest d for which G admits a map as above such that the images of the vertices of G are also in convex position. In this pap...