相关论文: The Tur\'{a}n and Delsarte problems and their dual…
We study Delsarte-type problems for positive definite functions on compact Gelfand pairs as infinite-dimensional linear programming problems. This setup includes, as a particular case, the case of compact Abelian groups. Depending on the…
A unifying framework for some extremal problems on locally compact Abelian groups is considered, special cases of which include the Delsarte and Tur\'an extremal problems. A slight variation of the extremal problem is introduced and the…
The Delsarte extremal problem for positive definite functions, originally introduced by Delsarte in coding theory to bound the size of error-correcting codes, has since found applications in diverse areas such as sphere packing, Fuglede's…
Let G be a locally compact Abelian group, and let X, Y be two open sets in G. We investigate the extremal constant C(X,Y) defined to be the supremum of integrals of functions f from the class F(X,Y), where F(X,Y) is the family of positive…
In this work we present two particular cases of the general duality result for linear optimisation problems over signed measures with infinitely many constraints in the form of integrals of functions with respect to the decision variables…
We study the following question posed by Turan. Suppose K is a convex body in Euclidean space which is symmetric with respect to the origin. Of all positive definite functions supported in K, and with value 1 at the origin, which one has…
Let G be a locally compact abelian group (LCA group) and U be an open, 0-symmetric set. Let F:=F(U) be the set of all real valued continuous functions from G to R which are supported in U and are positive definite. The Turan constant T(U)…
We analyze the general problem of determining optimally dense packings, in a Euclidean or hyperbolic space, of congruent copies of some fixed finite set of bodies. We are strongly guided by examples of aperiodic tilings in Euclidean space…
We study periodic tessellations of the Euclidean space with unequal cells arising from the minimization of perimeter functionals. Existence results and qualitative properties of minimizers are discussed for different classes of problems,…
Convex algebraic geometry concerns the interplay between optimization theory and real algebraic geometry. Its objects of study include convex semialgebraic sets that arise in semidefinite programming and from sums of squares. This article…
Generalized polyhedral convex optimization problems in locally convex Hausdorff topological vector spaces are studied systematically in this paper. We establish solution existence theorems, necessary and sufficient optimality conditions,…
The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…
We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity.…
We provide three new proofs of the strong concavity of the dual function of some convex optimization problems. For problems with nonlinear constraints, we show that the the assumption of strong convexity of the objective cannot be weakened…
The classical problem of optimal transportation can be formulated as a linear optimization problem on a convex domain: among all joint measures with fixed marginals find the optimal one, where optimality is measured against a cost function.…
We show that the problem of tiling the Euclidean plane with a finite set of polygons (up to translation) boils down to prove the existence of zeros of a non-negative convex function defined on a finite-dimensional simplex. This function is…
The following problem originated from a question due to Paul Turan. Suppose $\Omega$ is a convex body in Euclidean space $\RR^d$ or in $\TT^d$, which is symmetric about the origin. Over all positive definite functions supported in $\Omega$,…
Recently, Yamanaka and Yamashita proposed the so-called positively homogeneous optimization problem, which includes many important problems, such as the absolute-value and the gauge optimizations. They presented a closed form of the dual…
We study some approximation problems on a strict subset of the circle by analytic functions of the Hardy space H2 of the unit disk (in C), whose modulus satisfy a pointwise constraint on the complentary part of the circle. Existence and…
This paper presents a canonical d.c. (difference of canonical and convex functions) programming problem, which can be used to model general global optimization problems in complex systems. It shows that by using the canonical duality…