Maximizing The Distance To A "Far Enough" Point Over The Intersection Of Hyper-Disks

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 w...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2020-12
Main Authors: Marius-Simion Costandin, Gavrea, Bogdan, Costandin, Beniamin
Format: Article
Language:English
Subjects:
Algorithms
Computational geometry
Convexity
Feasibility studies
Linear programming
Polynomials
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2331-8422