Add to ORKGWe study finite convergence of the modified cyclic subgradient pro-jections (MCSP) algorithm for the convex feasibility problem (CFP) in the Euclidian space. Expanding control sequences allow the indices of the sets of the CFP to re-appear and be used again by the algorith
This book details approximate solutions to common fixed point problems and convex feasibility proble...
AbstractWe study the multiple-sets split feasibility problem that requires to find a point closest t...
Abstract. An iterative projection algorithm by adopting Armijo-like line search to solve the convex ...
We study some methods of subgradient projections for solving a convex feasibility problem with gener...
The convex feasibility problem (CFP) is a classical problem in nonlinear analysis. In this paper, we...
AbstractAn iterative method to solve the convex feasibility problem for a finite family of convex se...
Abstract The convex feasibility problem (CFP) is at the core of the modeling of many problems in var...
In this paper, we study the rate of convergence of the cyclic projection algorithm applied to finite...
We consider the convex feasibility problem (CFP) in Hilbert space and concentrate on the study of st...
In this paper, we study the rate of convergence of the cyclic projection algorithm applied to finite...
Abstract The subgradient projection iteration is a classical method for solving a convex inequality....
AbstractThe rate of convergence for the cyclic projections algorithm onto an intersection of finitel...
We study the subgradient projection method for convex optimization with Brannlund 's level cont...
AbstractThe cyclic projections algorithm is an important method for determining a point in the inter...
Abstract. We propose a new subgradient method for the minimization of nonsmooth convex functions ove...
This book details approximate solutions to common fixed point problems and convex feasibility proble...
AbstractWe study the multiple-sets split feasibility problem that requires to find a point closest t...
Abstract. An iterative projection algorithm by adopting Armijo-like line search to solve the convex ...
We study some methods of subgradient projections for solving a convex feasibility problem with gener...
The convex feasibility problem (CFP) is a classical problem in nonlinear analysis. In this paper, we...
AbstractAn iterative method to solve the convex feasibility problem for a finite family of convex se...
Abstract The convex feasibility problem (CFP) is at the core of the modeling of many problems in var...
In this paper, we study the rate of convergence of the cyclic projection algorithm applied to finite...
We consider the convex feasibility problem (CFP) in Hilbert space and concentrate on the study of st...
In this paper, we study the rate of convergence of the cyclic projection algorithm applied to finite...
Abstract The subgradient projection iteration is a classical method for solving a convex inequality....
AbstractThe rate of convergence for the cyclic projections algorithm onto an intersection of finitel...
We study the subgradient projection method for convex optimization with Brannlund 's level cont...
AbstractThe cyclic projections algorithm is an important method for determining a point in the inter...
Abstract. We propose a new subgradient method for the minimization of nonsmooth convex functions ove...
This book details approximate solutions to common fixed point problems and convex feasibility proble...
AbstractWe study the multiple-sets split feasibility problem that requires to find a point closest t...
Abstract. An iterative projection algorithm by adopting Armijo-like line search to solve the convex ...