Polyak's gradient method for split feasibility problem constrained by level sets
From MaRDI portal
Recommendations
- The ball-relaxed gradient-projection algorithm for split feasibility problem
- Gradient methods with selection technique for the multiple-sets split feasibility problem
- Gradient projection method with a new step size for the split feasibility problem
- On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
- A note on the multiple-set split convex feasibility problem in Hilbert space
Cites work
- scientific article; zbMATH DE number 3214008 (Why is no real title available?)
- scientific article; zbMATH DE number 3230744 (Why is no real title available?)
- A multiprojection algorithm using Bregman projections in a product space
- A relaxed projection method for variational inequalities
- A strongly convergent algorithm for the split common fixed point problem
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Accelerated projected gradient method for linear inverse problems with sparsity constraints
- An iterative regularization method for the solution of the split feasibility problem in Banach spaces
- Hilbertian convex feasibility problem: Convergence of projection methods
- Iterative Algorithms for Nonlinear Operators
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- Minimization of unsmooth functionals
- On Projection Algorithms for Solving Convex Feasibility Problems
- On rings of operators. Reduction theory
- On split common fixed point problems
- On the convergence of CQ algorithm with variable steps for the split equality problem
- On variable-step relaxed projection algorithm for variational inequalities
- Probing the Pareto frontier for basis pursuit solutions
- Properties and iterative methods for the lasso and its variants
- Proximity Maps for Convex Sets
- Signal Recovery by Proximal Forward-Backward Splitting
- Solving the split feasibility problem without prior knowledge of matrix norms
- Sparse image and signal processing. Wavelets, curvelets, morphological diversity
- The method of projections for finding the common point of convex sets
- The relaxed CQ algorithm solving the split feasibility problem
Cited in
(36)- On the shrinking projection method for the split feasibility problem in Banach spaces
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- A novel stepsize for gradient descent method
- A new inertial self-adaptive gradient algorithm for the split feasibility problem and an application to the sparse recovery problem
- The split feasibility problem with multiple output sets for demicontractive mappings
- A new self-adaptive CQ algorithm with an application to the LASSO problem
- scientific article; zbMATH DE number 7399383 (Why is no real title available?)
- A dynamic simultaneous algorithm for solving split equality fixed point problems
- Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces
- A Viscosity Iterative Method with Alternated Inertial Terms for Solving the Split Feasibility Problem
- ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
- Linear approximation method for solving split inverse problems and its applications
- Modified relaxed CQ methods for the split feasibility problems in Hilbert spaces with applications
- The ball-relaxed gradient-projection algorithm for split feasibility problem
- General splitting methods with linearization for the split feasibility problem
- A new CQ algorithm for solving split feasibility problems in Hilbert spaces
- Multiple-sets split quasi-convex feasibility problems: adaptive subgradient methods with convergence guarantee
- New inertial relaxed \(CQ\) algorithms for solving split feasibility problems in Hilbert spaces
- Strong convergence on the split feasibility problem by mixing \(W\)-mapping
- The split common fixed point problem with multiple output sets for strictly pseudo-contractive mappings
- Modified general splitting method for the split feasibility problem
- A generalized self-adaptive algorithm for the split feasibility problem in Banach spaces
- A novel projection method for split feasibility problems with applications to compressive sensing
- Alternated multi-step inertial iterative algorithm for solving the split feasibility problem in Hilbert spaces
- Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces
- The strong convergence of Douglas-Rachford methods for the split feasibility problem
- A new relaxed method for the split feasibility problem in Hilbert spaces
- Strong convergence of Bregman projection algorithms for solving split feasibility problems
- Alternating iterative algorithms for the split equality problem without prior knowledge of operator norms
- An inertial relaxed CQ algorithm with an application to the LASSO and elastic net
- Internal perturbation projection algorithm for the extended split equality problem and the extended split equality fixed point problem
- Strong convergence of two algorithms for the split feasibility problem in Banach spaces
- The split feasibility problem with polynomials
- The split common fixed point problem with multiple output sets for demicontractive mappings
- The ball-relaxed CQ algorithms for the split feasibility problem
- An alternated inertial general splitting method with linearization for the split feasibility problem
This page was built for publication: Polyak's gradient method for split feasibility problem constrained by level sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2413285)
