نتایج جستجو برای: l convex system
تعداد نتایج: 2808074 فیلتر نتایج به سال:
Let n ≥ l ≥ 2 and q ≥ 2. We consider the minimum N such that whenever we have N points in the plane in general position and the l-subsets of these points are colored with q colors, there is a subset S of n points all of whose l-subsets have the same color and furthermore S is in convex position. This combines two classical areas of intense study over the last 75 years: the Ramsey problem for hy...
Let n ≥ l ≥ 2 and q ≥ 2. We consider the minimum N such that whenever we have N points in the plane in general position and the l-subsets of these points are colored with q colors, there is a subset S of n points all of whose l-subsets have the same color and furthermore S is in convex position. This combines two classical areas of intense study over the last 75 years: the Ramsey problem for hy...
The following question arises in stochastic programming: how can one approximate a noisy convex function with a convex quadratic function that is optimal in some sense. Using several approaches for constructing convex approximations we present some optimization models yielding convex quadratic regressions that are optimal approximations in L1, L∞ and L2 norm. Extensive numerical experiments to ...
LET K C R3 be a simple closed curve, and K be its convex hull. In [l], Almgren and Thurston define the (oriented) convex hull genus of K to be the minimal genus of an (oriented) surface contained in g and bounded by K. They give examples showing that even if K is unknotted both the orientable and non-orientable convex hull genus of K may be arbitrarily large. In 43 of this paper we show that th...
The expected volume of the convex hull of n random points chosen independently and uniformly on the d-dimensional torus is determined. In the 1860's J. J. Sylvester raised the problem of determining the expected area V$(C) of the convex hull of three points chosen independently and uniformly at random from a given plane convex body C of area one. For some special plane convex bodies the problem...
Let L = ∆ + Z for a C vector field Z on a complete Riemannian manifold possibly with a boundary. A number of transportation-cost inequalities on the path space for the (reflecting) L-diffusion process are proved to be equivalent to the curvature condition Ric−∇Z ≥ −K and the convexity of the boundary (if exists). These inequalities are new even for manifolds without boundary, and are partly ext...
We propose a new stochastic L-BFGS algorithm and prove a linear convergence rate for strongly convex and smooth functions. Our algorithm draws heavily from a recent stochastic variant of L-BFGS proposed in Byrd et al. (2014) as well as a recent approach to variance reduction for stochastic gradient descent from Johnson and Zhang (2013). We demonstrate experimentally that our algorithm performs ...
We consider a different L-Minkowski combination of compact sets in R than the one introduced by Firey and we prove an L-BrunnMinkowski inequality, p ∈ [0, 1], for a general class of measures called convex measures that includes log-concave measures, under unconditional assumptions. As a consequence, we derive concavity properties of the function t 7→ μ(t 1 pA), p ∈ (0, 1], for unconditional con...
a r t i c l e i n f o a b s t r a c t Keywords: Graph algorithms Simple-path convexity Simple-path convex hull Totally balanced hypergraphs In a connected hypergraph a vertex set X is simple-path convex (sp-convex, for short) if either |X| 1 or X contains every vertex on every simple path between two vertices in X (Faber and Jamison, 1986 [7]), and the sp-convex hull of a vertex set X is the mi...
The DNA Inequality states that the average curvature of a curve inside of a given closed figure exceeds the average curvature of the figure. In the paper by Lagarias and Richardson (1997) that proved it for convex figures, the question arose if it could be possible to prove it for some non-convex region; the authors suggested L-Shaped regions. In this paper, we disprove the conjecture for L-Sha...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید