Related papers: Experimental study of energy-minimizing point conf…
We show that among antipodal $2d$-point configurations on the sphere $S^{d-1}$ in $\mathbb R^d$, the set of vertices of a regular cross-polytope inscribed in $S^{d-1}$ uniquely solves the best-covering problem (this is new for $d\geq 5$)…
Spherical t-designs are Chebyshev-type averaging sets on the d-sphere S^d which are exact for polynomials of degree at most t. This concept was introduced in 1977 by Delsarte, Goethals, and Seidel, who also found the minimum possible size…
Contemporary global optimization algorithms are based on local measures of utility, rather than a probability measure over location and value of the optimum. They thus attempt to collect low function values, not to learn about the optimum.…
We propose faster algorithms for the following three optimization problems on $n$ collinear points, i.e., points in dimension one. The first two problems are known to be NP-hard in higher dimensions. 1- Maximizing total area of disjoint…
Computer simulations serve as powerful tools for scientists and engineers to gain insights into complex systems. Less costly than physical experiments, computer experiments sometimes involve large number of trials. Conventional design…
This note discusses an essentially decentralized interior point method, which is well suited for optimization problems arising in energy networks. Advantages of the proposed method are guaranteed and fast local convergence also for problems…
In this paper, we first derive a theoretical basis for spherical conformal parameterizations between a simply connected closed surface $\mathcal{S}$ and a unit sphere $\mathbb{S}^2$ by minimizing the Dirichlet energy on…
The purpose of this paper is to explore the applications of quantum computing to energy systems optimization problems and discuss some of the challenges faced by quantum computers with techniques to overcome them. The basic concepts…
We study the Heilbronn triangle problem, which involves placing n points in the unit square such that the minimum area of any triangle formed by these points is maximized. A straightforward maximin formulation of this problem is highly…
This article provides numerical evidence that under volume constraint the ball is the set which maximizes the perimeter of the least-perimeter partition into cells with prescribed areas. We introduce a numerical maximization algorithm which…
We propose a simple method for uniform sampling of points on the surface of a hypersphere in arbitrarily many dimensions. By avoiding the evaluation of computationally expensive functions like logarithms, sines, cosines, or higher order…
Geometrical objects with integral side lengths have fascinated mathematicians through the ages. We call a set $P=\{p_1,...,p_n\}\subset\mathbb{Z}^2$ a maximal integral point set over $\mathbb{Z}^2$ if all pairwise distances are integral and…
Optimization of the mean efficiency for unambiguous (or error free)discrimination among $N$ given linearly independent nonorthogonal states should be realized in a way to keep the probabilistic quantum mechanical interpretation. This…
Broken rotational and translational symmetries are the hallmarks of solid state materials. In contrast, quantum liquids and gases do not exhibit such properties. However, if we regard the logarithm of the absolute square of a quantum liquid…
Optimization problems with both control variables and environmental variables arise in many fields. This paper introduces a framework of personalized optimization to han- dle such problems. Unlike traditional robust optimization,…
The difficulty in exploring potential energy surfaces, which are nonconvex, stems from the presence of many local minima, typically separated by high barriers and often disconnected in configurational space. We obtain the global minimum on…
We study unconstrained control of a two-level quantum system and analyse critical points of the objective functional which represents quantum average of system observable at some final time $T$. In Proc. Steklov Inst. Math. 285, 233-240…
The present paper is devoted to studying of minimal parametric fillings of finite metric spaces (a version of optimal connection problem) by methods of Linear Programming. The estimate on the multiplicity of multi-tours appearing in the…
We study equal weight numerical integration, or Quasi Monte Carlo (QMC) rules, for functions in a Sobolev space $H^s(S^d)$ with smoothness parameter $s>d/2$ defined over the unit sphere $S^d$ in $R^{d+1}$. Focusing on $N$-point sets that…
We consider the spectral problem for a family of $N$ point interactions of the same strength confined to a manifold with a rotational symmetry, a circle or a sphere, and ask for configurations that optimize the ground state energy of the…