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.
| Original language | English |
|---|---|
| Article number | 25 |
| Journal | Communications in Optimization Theory |
| Volume | 2026 |
| DOIs | |
| State | Published - 2026 |
Bibliographical note
Publisher Copyright:© 2026 Communications in Optimization Theory.
Keywords
- Feasibility-seeking
- Floorplanning
- Non-convex sets
- Projections onto sets expandable in convex sets
- Unions of convex sets
ASJC Scopus subject areas
- Control and Optimization
- Modeling and Simulation
- Numerical Analysis
Fingerprint
Dive into the research topics of 'AN ITERATIVE PROCESS FOR THE FEASIBILITY-SEEKING PROBLEM WITH SETS THAT ARE UNIONS OF CONVEX SETS'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver