Results 1 to 10 of about 6,104 (162)
Stability of a convex feasibility problem [PDF]
Journal of Global Optimization, 2019 17 ...
Carlo Alberto De Bernardi +1 more
exaly +4 more sources
Non-Convex Split Feasibility Problems: Models, Algorithms and Theory [PDF]
Open Journal of Mathematical Optimization, 2020 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 ...
Gibali, Aviv +2 more
doaj +3 more sources
On Projection Algorithms for Solving Convex Feasibility Problems
SIAM Review, 1996 Summary: Due to their extraordinary utility and broad applicability in many areas of classical mathematics and modern physical sciences (most notably, computerized tomography), algorithms for solving convex feasibility problems continue to receive great attention.
Heinz H Bauschke, Jonathan M Borwein
exaly +4 more sources
An approach for the convex feasibility problem via Monotropic Programming
Journal of Mathematical Analysis and Applications, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Regina S Burachik +1 more
exaly +3 more sources
The Combination Projection Method for Solving Convex Feasibility Problems [PDF]
Mathematics, 2018 In this paper, we propose a new method, which is called the combination projection method (CPM), for solving the convex feasibility problem (CFP) of finding some x * ∈ C : = ∩ i = 1 m { x ∈ H | c i ( x ) ≤ 0 } ,
Songnian He, Qiao-Li Dong
doaj +2 more sources
A Finitely Convergent Circumcenter Method for the Convex Feasibility Problem
SIAM Journal on OptimizationIn this paper, we present a variant of the circumcenter method for the Convex Feasibility Problem (CFP), ensuring finite convergence under a Slater assumption. The method replaces exact projections onto the convex sets with projections onto separating halfspaces, perturbed by positive exogenous parameters that decrease to zero along the iterations.
Roger Behling +2 more
exaly +4 more sources
Regularity and Stability for a Convex Feasibility Problem [PDF]
Set-Valued and Variational Analysis, 2021 AbstractLet us consider two sequences of closed convex sets {An} and {Bn} converging with respect to the Attouch-Wets convergence toAandB, respectively. Given a starting pointa0, we consider the sequences of points obtained by projecting onto the “perturbed” sets, i.e., the sequences {an} and {bn} defined inductively by$b_{n}=P_{B_{n}}(a_{n-1})$bn=PBn ...
Carlo Alberto De Bernardi +1 more
openaire +3 more sources
On the circumcentered-reflection method for the convex feasibility problem [PDF]
Numerical Algorithms, 2020 The ancient concept of circumcenter has recently given birth to the Circumcentered-Reflection method (CRM). CRM was first employed to solve best approximation problems involving affine subspaces. In this setting, it was shown to outperform the most prestigious projection based schemes, namely, the Douglas-Rachford method (DRM) and the method of ...
Roger Behling +2 more
openaire +2 more sources
The Ball-Relaxed Gradient-Projection Algorithm for Split Feasibility Problem
Journal of Function Spaces, 2022 In this paper, we concern with the split feasibility problem (SFP) whenever the convex sets involved are composed of level sets. By applying Gradient-projection algorithm which is used to solve constrained convex minimization problem of a real valued ...
Xiaochun Li, Xiaoxiao Liu, Fugen Gao
doaj +1 more source
Circumcentering approximate reflections for solving the convex feasibility problem
Fixed Point Theory and Algorithms for Sciences and Engineering, 2022 The circumcentered-reflection method (CRM) has been applied for solving convex feasibility problems. CRM iterates by computing a circumcenter upon a composition of reflections with respect to convex sets. Since reflections are based on exact projections,
G. H. M. Araújo +5 more
doaj +1 more source