Non-Convex Split Feasibility Problems: Models, Algorithms and Theory
Open Journal of Mathematical Optimization · 2020
DOI: 10.5802/ojmo.1 ↗At a glance
Journal article in Open Journal of Mathematical Optimization, 2020. Written by Aviv Gibali and 2 co-authors. Cited 10 times so far (Crossref); 37 references.
Abstract (original language)
In this paper, we propose a catalog of iterative methods for solving the Split Feasibility Problem in the non-convex setting. We study four different optimization formulations of the problem, where each model has advantages in different settings of the problem. For each model, we study relevant iterative algorithms, some of which are well-known in this area and some are new. All the studied methods, including the well-known CQ Algorithm, are proven to have global convergence guarantees in the non-convex setting under mild conditions on the problem’s data.
Cite
APA
Gibali, A., Sabach, S., & Voldman, S. (2020). Non-Convex Split Feasibility Problems: Models, Algorithms and Theory. Open Journal of Mathematical Optimization. https://doi.org/10.5802/ojmo.1
Vancouver
Gibali A, Sabach S, Voldman S. Non-Convex Split Feasibility Problems: Models, Algorithms and Theory. Open Journal of Mathematical Optimization. 2020. doi:10.5802/ojmo.1
BibTeX
@article{Gibali2020,
author = {Gibali, Aviv and Sabach, Shoham and Voldman, Sergey},
title = {Non-Convex Split Feasibility Problems: Models, Algorithms and Theory},
journal = {Open Journal of Mathematical Optimization},
year = {2020},
doi = {10.5802/ojmo.1}
}
EUVIMED