Inertial relaxed CQ algorithm for split feasibility problems with non-Lipschitz gradient operators
From MaRDI portal
Publication:6042226
DOI10.1080/02331934.2021.2010077zbMATH Open1517.47103OpenAlexW4200450928MaRDI QIDQ6042226FDOQ6042226
Authors:
Publication date: 16 May 2023
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2021.2010077
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
Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Iterative procedures involving nonlinear operators (47J25)
Cites Work
- Title not available (Why is that?)
- Convex analysis and monotone operator theory in Hilbert spaces
- A multiprojection algorithm using Bregman projections in a product space
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- The multiple-sets split feasibility problem and its applications for inverse problems
- Iterative oblique projection onto convex sets and the split feasibility problem
- On variable-step relaxed projection algorithm for variational inequalities
- Solving the split feasibility problem without prior knowledge of matrix norms
- A relaxed projection method for variational inequalities
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space
- Solving proximal split feasibility problems without prior knowledge of operator norms
- Fixed Point Theory for Lipschitzian-type Mappings with Applications
- Weak and strong convergence theorems for fixed points of asymptotically nonexpansive mappings
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- A cyclic and simultaneous iterative method for solving the multiple-sets split feasibility problem
- Some methods of speeding up the convergence of iteration methods
- An algorithm for a class of split feasibility problems: application to a model in electricity production
- On the convergence of CQ algorithm with variable steps for the split equality problem
- Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
- ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces
- An inertial subgradient extragradient algorithm extended to pseudomonotone equilibrium problems
- New inertial relaxed method for solving split feasibilities
- On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
- Projection methods with alternating inertial steps for variational inequalities: weak and linear convergence
- A new CQ algorithm for solving split feasibility problems in Hilbert spaces
- An optimization approach to solving the split feasibility problem in Hilbert spaces
- Inertial accelerated algorithms for solving a split feasibility problem
- A new self-adaptive CQ algorithm with an application to the LASSO problem
- A family of projection gradient methods for solving the multiple-sets split feasibility problem
- An inertial type iterative method with Armijo linesearch for nonmonotone equilibrium problems
- Convergence of inexact Mann iterations generated by nearly nonexpansive sequences and applications
- A subgradient algorithm for a class of nonlinear split feasibility problems: application to jointly constrained Nash equilibrium models
- Iterative method with inertial terms for nonexpansive mappings: applications to compressed sensing
Cited In (12)
- Alternated inertial algorithms for split feasibility problems
- 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
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- 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
- On inertial non-Lipschitz stepsize algorithms for split feasibility problems
- Relaxed CQ algorithms involving the inertial technique for multiple-sets 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)
