Strong convergence of Bregman projection algorithms for solving split feasibility problems
From MaRDI portal
Cites work
- A multiprojection algorithm using Bregman projections in a product space
- A new self-adaptive CQ algorithm with an application to the LASSO problem
- A note on the CQ algorithm for the split feasibility problem
- A Tseng extragradient method for solving variational inequality problems in Banach spaces
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
- An iterative algorithm for solving split feasibility problems and fixed point problems in Banach spaces
- Analysis of two versions of relaxed inertial algorithms with Bregman divergences for solving variational inequalities
- Bregman distances and Chebyshev sets
- Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces
- Bregman Divergence Based Em Algorithm and its Application to Classical and Quantum Rate Distortion Theory
- Convergence results of two-step inertial proximal point algorithm
- Forcing strong convergence of proximal point iterations in a Hilbert space
- General splitting methods with linearization for the split feasibility problem
- Global and linear convergence of alternated inertial methods for split feasibility problems
- scientific article; zbMATH DE number 5653524 (Why is no real title available?)
- scientific article; zbMATH DE number 1046019 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces
- Inertial-type algorithm for solving split common fixed point problems in Banach spaces
- Iterative methods for approximating fixed points of Bregman nonexpansive operators
- Iterative oblique projection onto convex sets and the split feasibility problem
- Minimization of unsmooth functionals
- New Bregman projection methods for solving pseudo-monotone variational inequality problem
- New inertial relaxed method for solving split feasibilities
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- On modified Halpern and Tikhonov-Mann iterations
- Polyak's gradient method for split feasibility problem constrained by level sets
- R-linear convergence analysis of inertial extragradient algorithms for strongly pseudo-monotone variational inequalities
- Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
- Self-adaptive algorithms for solving split feasibility problem with multiple output sets
- Solving the split feasibility problem without prior knowledge of matrix norms
- Some methods of speeding up the convergence of iteration methods
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- Subgradient extragradient method with double inertial steps for variational inequalities
- Weak and strong convergence of an inertial proximal method for solving Ky Fan minimax inequalities
Cited in
(1)
This page was built for publication: Strong convergence of Bregman projection algorithms for solving split feasibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6649261)
