Non-Convex Split Feasibility Problems: Models, Algorithms and Theory
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 iter...
Saved in:
Main Authors: | Gibali, Aviv, Sabach, Shoham, Voldman, Sergey |
---|---|
Format: | Article |
Language: | English |
Published: |
Université de Montpellier
2020-10-01
|
Series: | Open Journal of Mathematical Optimization |
Subjects: | |
Online Access: | https://ojmo.centre-mersenne.org/articles/10.5802/ojmo.1/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A modified proximal point algorithm for solving variational inclusion problem in real Hilbert spaces
by: Thierno M. M. Sow
Published: (2020-06-01) -
Dentable functions and radially uniform quasi-convexity
by: Carl G. Looney
Published: (1978-01-01) -
A cutting-plane method with internal iteration points for the general convex programming problem
by: I. Ya. Zabotin, et al.
Published: (2024-01-01) -
Inertial-relaxed splitting for composite monotone inclusions
by: Oré, Ernesto, et al.
Published: (2023-02-01) -
Sparse Regularization With Reverse Sorted Sum of Squares via an Unrolled Difference-of-Convex Approach
by: Takayuki Sasaki, et al.
Published: (2025-01-01)