Maximizing The Distance To A "Far Enough" Point Over The Intersection Of Hyper-Disks
Optimization and Control
2020-12-18 v2 Computational Complexity
Abstract
We present a novel feasibility criteria for the finite intersection of convex sets given by inequalities. This criteria allows us to easily assert the feasibility by analyzing the unconstrained minimum of a speci?fic convex function, that we form with the given sets. Next an algorithm is presented which extends the idea to a particular non-convex case: assert the inclusion of the fi?nite intersection of a set of hyper-disks with equal radii in another hyper-disk with a different radius.
Cite
@article{arxiv.2007.00912,
title = {Maximizing The Distance To A "Far Enough" Point Over The Intersection Of Hyper-Disks},
author = {Marius-Simion Costandin and Bogdan Gavrea and Beniamin Costandin},
journal= {arXiv preprint arXiv:2007.00912},
year = {2020}
}