A class of polyhedral-spherical configurations as finite point configurations inscribed into a hypersphere is defined. Approaches to the determination of configuration parameters are proposed. The properties of optimization problems on polyhedral-spherical configurations are considered, theorems on the existence of convex extensions of functions and estimates of their lower bounds are formulated. The results are extended to the class of quadratic functions defined on permutation configurations.
No takes yet. Share an insight, caveat, or question.
Yakovlev et al. (2019) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: