Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces
From MaRDI portal
Publication:2035511
Recommendations
- New inertial relaxed CQ algorithms for solving split feasibility problems in Hilbert spaces
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- scientific article; zbMATH DE number 7399383
- Strong convergence of a relaxed CQ algorithm for the split feasibility problem
- Inertial relaxed CQ algorithm for split feasibility problems with non-Lipschitz gradient operators
Cites work
- ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
- A multiprojection algorithm using Bregman projections in a product space
- A new CQ algorithm for solving split feasibility problems in Hilbert spaces
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- A new self-adaptive CQ algorithm with an application to the LASSO problem
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- Applications of the S-iteration process to constrained minimization problems and split feasibility problems
- Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process
- Convergence of inexact Mann iterations generated by nearly nonexpansive sequences and applications
- Convex analysis and monotone operator theory in Hilbert spaces
- Fixed Point Theory for Lipschitzian-type Mappings with Applications
- General inertial Mann algorithms and their convergence analysis for nonexpansive mappings
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 7122370 (Why is no real title available?)
- Inertial accelerated algorithms for solving a split feasibility problem
- Inertial iterative process for fixed points of certain quasi-nonexpansive mappings
- Inertial projection and contraction algorithms for variational inequalities
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- MiKM: multi-step inertial Krasnosel'skiǐ-Mann algorithm and its applications
- Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
- Monotone Operators and the Proximal Point Algorithm
- New inertial relaxed method for solving split feasibilities
- On Projection Algorithms for Solving Convex Feasibility Problems
- On solving proximal split feasibility problems and applications
- On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
- On variable-step relaxed projection algorithm for variational inequalities
- Polyak's gradient method for split feasibility problem constrained by level sets
- Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
- Solving the split feasibility problem without prior knowledge of matrix norms
- Some algorithms for classes of split feasibility problems involving paramonotone equilibria and convex optimization
- Some methods of speeding up the convergence of iteration methods
- Some results for split equality equilibrium problems in Banach spaces
- Split feasibility and fixed point problems
- The multiple-sets split feasibility problem and its applications for inverse problems
- The split feasibility problem and its solution algorithm
- Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces
Cited in
(57)- A relaxed alternating CQ-algorithm for convex feasibility problems
- New inertial relaxed CQ algorithms for solving split feasibility problems in Hilbert spaces
- The iterative method for solving the proximal split feasibility problem with an application to LASSO problem
- Self adaptive inertial relaxed CQ algorithms for solving split feasibility problem with multiple output sets
- An inertial triple-projection algorithm for solving the split feasibility problem
- An inertial Mann forward-backward splitting algorithm of variational inclusion problems and its applications
- Inertial extragradient algorithms with non-monotone stepsizes for pseudomonotone variational inequalities and applications
- An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces
- Two optimization approaches for solving split variational inclusion problems with applications
- An extended inertial Halpern-type ball-relaxed \(CQ\) algorithm for multiple-sets split feasibility problem
- Linear approximation method for solving split inverse problems and its applications
- A new CQ algorithm for solving split feasibility problems in Hilbert spaces
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- Some new classes of quasi split feasibility problems
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- The strong convergence of a KM-CQ-like algorithm for a split feasibility problem
- scientific article; zbMATH DE number 7399383 (Why is no real title available?)
- Inertial relaxed CQ algorithm with an application to signal processing
- Improved relaxed CQ method with inertial accelerated technique for the split feasibility problem
- Strong convergence of a relaxed CQ algorithm for the split feasibility problem
- A perturbed projection algorithm with inertial technique for split feasibility problem
- scientific article; zbMATH DE number 6876349 (Why is no real title available?)
- scientific article; zbMATH DE number 7560606 (Why is no real title available?)
- Alternating CQ-algorithms for convex feasibility and split fixed-point problems
- Inertial relaxed CQ algorithm for split feasibility problems with non-Lipschitz gradient operators
- Two inertial-type algorithms for solving the split feasibility problem
- A relaxed inertial and viscosity method for split feasibility problem and applications to image recovery
- On some novel methods for solving the generalized Fermat-Torricelli problem in Hilbert spaces
- An inertial self-adaptive iterative algorithm for finding the common solutions to split feasibility and fixed point problems in specific Banach spaces
- Alternated inertial algorithms for split feasibility problems
- Strong convergence of forward-reflected-backward splitting methods for solving monotone inclusions with applications to image restoration and optimal control
- Second order self-adaptive dynamical system for sparse signal reconstruction and applications to image recovery
- An inertial accelerated outer quadratic approximation method for split feasibility problem with application to elastic net
- On some fast iterative methods for split variational inclusion problem and fixed point problem of demicontractive mappings
- An accelerated stochastic extragradient-like algorithm with new stepsize rules for stochastic variational inequalities
- A new optimization approach to solving split equality problems in Hilbert spaces
- Strong convergence algorithm for proximal split feasibility problem
- On inertial non-Lipschitz stepsize algorithms for split feasibility problems
- Modified general splitting method for the split feasibility problem
- Alternated multi-step inertial iterative algorithm for solving the split feasibility problem in Hilbert spaces
- Strong convergence of Bregman projection algorithms for solving split feasibility problems
- A dynamical system with fixed-time convergence for solving the split feasibility problem and applications to signal recovery
- Multi-step inertial algorithms for equilibrium, fixed point, general systems of variational inequalities and split feasibility problems
- Halpern-type Bregman projection algorithms for split variational inequality problems
- Pre-conditioning CQ algorithm for solving the split feasibility problem and its application to image restoration problem
- Self-adaptive double inertial schemes for variational inequalities with applications to optimal control problems
- Alternated and multi-step inertial algorithm with three-term conjugate gradient-like direction for split feasibilities with applications in classification problems and elastic net
- Two projection algorithms for solving split mixed variational inequalities
- Halpern-type relaxed algorithms with alternated and multi-step inertia for split feasibility problems with applications in classification problems
- Neurodynamic optimization algorithm for split equality problems and application to sparse signal recovery
- An inertial conjugate gradient projection method for the split feasibility problem
- Research on a strong convergence theorem for proximal split feasibility problems with non-Lipschitz stepsizes
- Two inertial multistep projection-type algorithms for solving mixed split feasibility problems in Hilbert space
- Self-adaptive iterative proximal method for split minimization problems with applications to image and signal processing
- Preconditioning splitting methods for the split feasibility problem
- Modified inertial self-adaptive techniques for the split feasibility problem
- Self-adaptive inertial single projection methods for variational inequalities involving non-Lipschitz and Lipschitz operators with their applications to optimal control problems
This page was built for publication: Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2035511)
