Related papers: Optimal convex shapes for concave functionals
In this paper we derive strong linear inequalities for sets of the form {(x, q) \in Rd \times R : q \geq Q(x), x \in Rd - int(P)}, where Q(x) : Rd \rightarrow R is a quadratic function, P \subset Rd and "int" denotes interior. Of particular…
This article deals with the sharp discrete isoperimetric inequalities in analysis and geometry for planar convex polygons. First, the analytic isoperimetric inequalities based on Schur convex function are established. In the wake of the…
Convexity prior is one of the main cue for human vision and shape completion with important applications in image processing, computer vision. This paper focuses on characterization methods for convex objects and applications in image…
If the complement of a closed convex set in a closed convex cone is bounded, then this complement minus the apex of the cone is called a coconvex set. Coconvex sets appear in singularity theory (they are closely related to Newton diagrams)…
In this note we show how to construct a number of nonconvex quadratic inequalities for a variety of physics equations appearing in physical design problems. These nonconvex quadratic inequalities can then be used to construct bounds on…
In shape optimisation it is desirable to obtain deformations of a given mesh without negative impact on the mesh quality. We propose a new algorithm using least square formulations of the Cauchy-Riemann equations. Our method allows to…
We prove several discrete Gagliardo-Nirenberg-Sobolev and Poincar\'e-Sobolev inequalities for some approximations with arbitrary boundary values on finite volume meshes. The keypoint of our approach is to use the continuous embedding of the…
We describe the first-order variations of the angles of Euclidean, spherical or hyperbolic polygons under infinitesimal deformations such that the lengths of the edges do not change. Using this description, we introduce a vector-valued…
This study focuses on convex functions and their generalized. Thus, we start this study by giving the definition of convex functions and some of their properties and discussing a simple geometric property. Then we generalize E-convex…
In this paper, we extend and generalize several previous works on maximal-volume positions of convex bodies. First, we analyze the maximal positive-definite image of one convex body inside another, and the resulting decomposition of the…
We associate convex bodies to a wide class of graded G-algebras where G is a connected reductive group. These convex bodies give information about the Hilbert function as well as multiplicities of irreducible representations appearing in…
In this paper we study the right differentiability of a parametric infimum function over a parametric set defined by equality constraints. We present a new theorem with sufficient conditions for the right differentiability with respect to…
We solve several new sharp inequalities relating three quantities amongst the area, perimeter, inradius, circumradius, diameter, and minimal width of planar convex bodies. As a consequence, we narrow the missing gaps in each of the missing…
In this survey we present the fractional Polya Szego principle and its main consequences in the study of nonlocal functional inequalities. In particular, we show how symmetrization methods work also in the fractional setting and yield sharp…
Convex optimization is a vibrant and successful area due to the existence of a variety of efficient algorithms that leverage the rich structure provided by convexity. Convexity of a smooth set or a function in a Euclidean space is defined…
We prove a general result about the behaviour of minimizing sequences for nonlocal shape functionals satisfying suitable structural assumptions. Typical examples include functions of the eigenvalues of the fractional Laplacian under…
Seminal work by Edmonds and Lovasz shows the strong connection between submodularity and convexity. Submodular functions have tight modular lower bounds, and subdifferentials in a manner akin to convex functions. They also admit poly-time…
We revisit an ingenious argument of K. Ball to provide sharp estimates for the volume of sections of a convex body in John's position. Our technique combines the geometric Brascamp-Lieb inequality with a generalised Parseval-type identity.…
(Renegar, 2016) introduced a novel approach to transforming generic conic optimization problems into unconstrained, uniformly Lipschitz continuous minimization. We introduce {\it radial transformations} generalizing these ideas, equipped…
We propose a two-level structural optimization method for obtaining an approximate optimal shape of piecewise developable surface without specifying internal boundaries between surface patches. The condition for developability of a…