A Minimax Optimization Approach To The Spherical Codes Problem

Keywords

dot product; optimization; sphere; spherical code; stereographic projection

Abstract

A spherical code with parameter $(n, N,\gamma)$ is a set of N points on the unit sphere in $n$ dimension for which the dot product of unit vectors from the origin to any two points is less than or equal to $\gamma$. If each point on the unit sphere is treated as an electron, one approach to this spherical code problem is to define an electrostatic energy of electrons and to optimize for minimum energy. A configuration with minimum energy corresponds to a useful spherical code, but may not be the global minimum solution. Thus, minimizing the energy function does not always minimize $y$. A global solution for the spherical code problem for most of parameters $(n, N)$ is unknown, especially for spherical codes in higher dimension. In this paper, a minimax optimization approach for obtaining spherical codes is analyzed. In this paper, four algorithms are proposed to solve the spherical code problem. The first algorithm is implemented using linear programming with trust region. The second is based on the introduction of the energy function. The third algorithm is based on minimizing the maximum of the dot product of any pairs of unit vectors and the last algorithm is based on the Groebner Bases. By running simulation with these algorithms, configurations for many of the best known spherical codes found in literature were obtained.

Publication Date

12-1-2018

Publication Title

2018 IEEE International WIE Conference on Electrical and Computer Engineering, WIECON-ECE 2018

Number of Pages

9-12

Document Type

Article; Proceedings Paper

Personal Identifier

scopus

DOI Link

https://doi.org/10.1109/WIECON-ECE.2018.8783011

Socpus ID

85070932061 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/85070932061

This document is currently not available here.

Share

COinS