Inertial relaxed CQ algorithm for split feasibility problems with non-Lipschitz gradient operators
From MaRDI portal
Publication:6042226
Recommendations
- scientific article; zbMATH DE number 7399383
- New inertial relaxed \(CQ\) algorithms for solving split feasibility problems in Hilbert spaces
- Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A cyclic and simultaneous iterative method for solving the multiple-sets split feasibility problem
- A family of projection gradient methods for solving the multiple-sets 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
- A relaxed projection method for variational inequalities
- A subgradient algorithm for a class of nonlinear split feasibility problems: application to jointly constrained Nash equilibrium models
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- An algorithm for a class of split feasibility problems: application to a model in electricity production
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- An inertial subgradient extragradient algorithm extended to pseudomonotone equilibrium problems
- An inertial type iterative method with Armijo linesearch for nonmonotone equilibrium problems
- An optimization approach to solving the split feasibility problem in Hilbert spaces
- 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
- Inertial accelerated algorithms for solving a split feasibility problem
- Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces
- Iterative method with inertial terms for nonexpansive mappings: applications to compressed sensing
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
- New inertial relaxed method for solving split feasibilities
- On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
- On the convergence of CQ algorithm with variable steps for the split equality problem
- On variable-step relaxed projection algorithm for variational inequalities
- Projection methods with alternating inertial steps for variational inequalities: weak and linear convergence
- Solving proximal split feasibility problems without prior knowledge of operator norms
- Solving the split feasibility problem without prior knowledge of matrix norms
- Some methods of speeding up the convergence of iteration methods
- The multiple-sets split feasibility problem and its applications for inverse problems
- Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space
- Weak and strong convergence theorems for fixed points of asymptotically nonexpansive mappings
- ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
Cited in
(12)- Alternated inertial algorithms for split feasibility problems
- scientific article; zbMATH DE number 7399383 (Why is no real title available?)
- Convergence analysis of a new relaxed algorithm with inertial for solving split feasibility problems
- Two new inertial relaxed gradient CQ algorithms on the split equality problem
- New hybrid inertial CQ projection algorithms with line-search process for the split feasibility problem
- Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces
- On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
- scientific article; zbMATH DE number 7560606 (Why is no real title available?)
- New inertial relaxed \(CQ\) algorithms for solving split feasibility problems in Hilbert spaces
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
- On inertial non-Lipschitz stepsize algorithms for split feasibility problems
This page was built for publication: Inertial relaxed CQ algorithm for split feasibility problems with non-Lipschitz gradient operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6042226)
