An iterative process for the feasibility-seeking problem with sets that are unions of convex sets
Optimization and Control
2025-04-08 v1 Numerical Analysis
Numerical Analysis
Abstract
In this paper we deal with the feasibility-seeking problem for unions of convex sets (UCS) sets and propose an iterative process for its solution. Renewed interest in this problem stems from the fact that it was recently discovered to serve as a modeling approach in fields of applications and from the ongoing recent research efforts to handle non-convexity in feasibility-seeking.
Keywords
Cite
@article{arxiv.2504.04912,
title = {An iterative process for the feasibility-seeking problem with sets that are unions of convex sets},
author = {Yair Censor and Alexander J. Zaslavski},
journal= {arXiv preprint arXiv:2504.04912},
year = {2025}
}
Comments
Accepted for publication in: Communications in Optimization Theory