A subgradient algorithm for a class of nonlinear split feasibility problems: application to jointly constrained Nash equilibrium models
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Global Optimization"
DOI: 10.1007/s10898-018-00735-0
Abstract: In this paper we propose an algorithm for solving the split feasibility problem $$x\in C, Ax\in Q$$x∈C,Ax∈Q with C being the solution set of an equilibrium problem and A can be nonlinear. The proposed algorithm… read more here.
Keywords: split feasibility; equilibrium; jointly constrained; constrained nash ... See more keywords
On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
Sign Up to like & getrecommendations! Published in 2019 at "Numerical Algorithms"
DOI: 10.1007/s11075-019-00790-y
Abstract: In this work, based on the gradient method and the relaxed CQ algorithm introduced by López et al. (Inverse Probl. 28 , 085004, 2012 ), we introduce two gradient-CQ algorithms for solving the split feasibility… read more here.
Keywords: feasibility problem; gradient algorithms; split feasibility;
Convergence analysis for the proximal split feasibility problem using an inertial extrapolation term method
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Fixed Point Theory and Applications"
DOI: 10.1007/s11784-017-0435-z
Abstract: In this paper, we present a proximal split feasibility algorithm with an additional inertial extrapolation term for solving a proximal split feasibility problem under weaker conditions on the step sizes. The two convex and lower… read more here.
Keywords: split feasibility; inertial extrapolation; proximal split; split ... See more keywords
A New CQ Algorithm for Solving Split Feasibility Problems in Hilbert Spaces
Sign Up to like & getrecommendations! Published in 2019 at "Bulletin of the Malaysian Mathematical Sciences Society"
DOI: 10.1007/s40840-018-0614-0
Abstract: In this paper, we propose a CQ-type algorithm for solving the split feasibility problem (SFP) in real Hilbert spaces. The algorithm is designed such that the step-sizes are directly computed at each iteration. We will… read more here.
Keywords: split feasibility; new algorithm; hilbert spaces; algorithm solving ... See more keywords
A New Unconstrained Optimization Approach to Solving Mixed Split Feasibility Problems
Sign Up to like & getrecommendations! Published in 2025 at "Numerical Functional Analysis and Optimization"
DOI: 10.1080/01630563.2025.2522385
Abstract: Abstract We introduce an unconstrained optimization approach to solving mixed split feasibility problems in Hilbert spaces. We use a method of selecting the control parameters so that the implementation of our algorithms does not require… read more here.
Keywords: unconstrained optimization; split; optimization approach; split feasibility ... See more keywords
Gradient methods with selection technique for the multiple-sets split feasibility problem
Sign Up to like & getrecommendations! Published in 2019 at "Optimization"
DOI: 10.1080/02331934.2019.1602772
Abstract: ABSTRACT In this paper, we present two new iterative algorithms for approximating a solution of the multiple-sets split feasibility problem. The suggested algorithms are based on the gradient method with selection technique. Weak and strong… read more here.
Keywords: selection technique; split feasibility; feasibility problem; sets split ... See more keywords
Stability of nonhomogeneous split equality and split feasibility problems with possibly nonconvex constraint sets
Sign Up to like & getrecommendations! Published in 2024 at "Optimization"
DOI: 10.1080/02331934.2025.2508499
Abstract: By applying some techniques of set-valued and variational analysis, we study solution stability of nonhomogeneous split equality problems and nonhomogeneous split feasibility problems, where the constraint sets need not be convex. Necessary and sufficient conditions… read more here.
Keywords: split equality; feasibility problems; split; split feasibility ... See more keywords
Generalized relaxed inertial method with regularization for solving split feasibility problems in real Hilbert spaces
Sign Up to like & getrecommendations! Published in 2021 at "Asian-European Journal of Mathematics"
DOI: 10.1142/s1793557122501066
Abstract: In this paper, we propose a new modified relaxed inertial regularization method for finding a common solution of a generalized split feasibility problem, the zeros of sum of maximal monotone operators, and fixed point problem… read more here.
Keywords: real hilbert; split feasibility; hilbert spaces; method ... See more keywords
New Inertial Relaxed CQ Algorithms for Solving Split Feasibility Problems in Hilbert Spaces
Sign Up to like & getrecommendations! Published in 2021 at "Journal of Mathematics"
DOI: 10.1155/2021/6624509
Abstract: The split feasibility problem has received much attention due to its various applications in signal processing and image reconstruction. In this paper, we propose two inertial relaxed algorithms for solving the split feasibility problem in… read more here.
Keywords: split feasibility; algorithms solving; inertial relaxed; solving split ... See more keywords
An Efficient Iterative Algorithm for Solving the Split Feasibility Problem in Hilbert Spaces Applicable in Image Deblurring, Signal Recovering, and Polynomiography
Sign Up to like & getrecommendations! Published in 2023 at "Journal of Mathematics"
DOI: 10.1155/2023/4934575
Abstract: The split feasibility problem (SFP) in Hilbert spaces is addressed in this study using an efficient iterative approach. Under mild conditions, we prove convergence theorems for the algorithm for finding a solution to the SFP.… read more here.
Keywords: image deblurring; feasibility problem; efficient iterative; deblurring signal ... See more keywords
Some algorithms for classes of split feasibility problems involving paramonotone equilibria and convex optimization
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Inequalities and Applications"
DOI: 10.1186/s13660-019-2030-x
Abstract: In this paper, we first introduce a new algorithm which involves projecting each iteration to solve a split feasibility problem with paramonotone equilibria and using unconstrained convex optimization. The strong convergence of the proposed algorithm… read more here.
Keywords: convex optimization; split feasibility; optimization; paramonotone equilibria ... See more keywords