A new inertial self-adaptive algorithm for split common fixed-point problems
From MaRDI portal
(Redirected from Publication:5152048)
Recommendations
- An inertial method for split common fixed point problems in Hilbert spaces
- Self-adaptive algorithms with inertial effects for solving the split problem of the demicontractive operators
- Inertial accelerated algorithms for the split common fixed-point problem of directed operators
- A new accelerated self-adaptive stepsize algorithm with excellent stability for split common fixed point problems
- An inertial method for solving split common fixed point problems
Cites work
- A hybrid steepest descent method for solving split feasibility problems involving nonexpansive mappings
- A monotone Bregan projection algorithm for fixed point and equilibrium problems in a reflexive Banach space
- A multiprojection algorithm using Bregman projections in a product space
- A new method for split common fixed-point problem without priori knowledge of operator norms
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- A note on the split common fixed-point problem for quasi-nonexpansive operators
- A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
- A self-adaptive iterative algorithm for the split common fixed point problems
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Adaptively relaxed algorithms for solving the split feasibility problem with a new step size
- An inertial method for solving split common fixed point problems
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- Convergence rate analysis of proximal gradient methods with applications to composite minimization problems
- Convergence theorems for inertial KM-type algorithms
- Generalized extragradient iterative methods for solving split feasibility and fixed point problems in Hilbert spaces
- scientific article; zbMATH DE number 5624813 (Why is no real title available?)
- scientific article; zbMATH DE number 6876349 (Why is no real title available?)
- scientific article; zbMATH DE number 7347501 (Why is no real title available?)
- Hybrid inertial accelerated algorithms for split fixed point problems of demicontractive mappings and equilibrium problems
- Inertial splitting method for maximal monotone mappings
- Iterative algorithms for solving the split feasibility problem in Hilbert spaces
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- New inertial relaxed method for solving split feasibilities
- On variable-step relaxed projection algorithm for variational inequalities
- Qualitative properties of the minimum sum-of-squares clustering problem
- Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
- Self-adaptive algorithms with inertial effects for solving the split problem of the demicontractive operators
- Solving the split feasibility problem without prior knowledge of matrix norms
- Some methods of speeding up the convergence of iteration methods
- Two projection algorithms for solving the split common fixed point problem
- Viscosity approximation methods for split common fixed-point problem of directed operators
- Weak convergence of a splitting algorithm in Hilbert spaces
Cited in
(27)- A new method for split common fixed-point problem without priori knowledge of operator norms
- An inertial method for solving split common fixed point problems
- An inertial method for split common fixed point problems in Hilbert spaces
- Inertial iteration for split common fixed-point problem for quasi-nonexpansive operators
- Inertial shrinking projection algorithm with self-adaptive step size for split generalized equilibrium and fixed point problems for a countable family of nonexpansive multivalued mappings
- A self adaptive inertial algorithm for solving split variational inclusion and fixed point problems with applications
- A new self-adaptive accelerated method for generalized split system of common fixed-point problem of averaged mappings
- Several inertial methods for solving split convex feasibilities and related problems
- A new accelerated self-adaptive stepsize algorithm with excellent stability for split common fixed point problems
- Self-adaptive algorithms with inertial effects for solving the split problem of the demicontractive operators
- Reckoning solution of split common fixed point problems by using inertial self-adaptive algorithms
- A self-adaptive iterative algorithm for the split common fixed point problems
- A new iterative method for the split common fixed point problem in Hilbert spaces
- A parallel inertial S-iteration forward-backward algorithm for regression and classification problems
- Self-adaptive step-sizes choice for split common fixed point problems
- Inertial accelerated algorithms for the split common fixed-point problem of directed operators
- An inertial Censor-Segal algorithm for split common fixed-point problems
- An accelerated hybrid projection method with a self-adaptive step-size sequence for solving split common fixed point problems
- Self-adaptive algorithms for an equilibrium split problem in Hilbert spaces
- Weak convergence theorem of generalized self-adaptive algorithms for solving split common fixed point problems
- Inertial algorithm with self-adaptive step size for split common null point and common fixed point problems for multivalued mappings in Banach spaces
- New iterative algorithms with self-adaptive step size for solving split equality fixed point problem and its applications
- An inertial self-adaptive iterative algorithm for finding the common solutions to split feasibility and fixed point problems in specific Banach spaces
- Inertial accelerated steepest descent algorithm for generalized split common fixed point problems
- A new inertial self-adaptive gradient algorithm for the split feasibility problem and an application to the sparse recovery problem
- Inertial methods for split common fixed point problems: application to binary classification in machine learning
- Inertial self-adaptive algorithms for solving non-smooth convex optimization problems
This page was built for publication: A new inertial self-adaptive algorithm for split common fixed-point problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5152048)
