Alternated inertial algorithms for split feasibility problems
From MaRDI portal
alternated inertial methodCQ methodimage restorationprojection and contraction methodsignal processingsplit feasibility problem
Variational and other types of inequalities involving nonlinear operators (general) (47J20) Iterative procedures involving nonlinear operators (47J25) Variational methods involving nonlinear operators (47J30) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical optimization and variational techniques (65K10) Numerical methods for variational inequalities and related problems (65K15)
Recommendations
- New inertial relaxed CQ algorithms for solving split feasibility problems in Hilbert spaces
- New inertial relaxed method for solving split feasibilities
- Inertial accelerated algorithms for solving a split feasibility problem
- Two inertial-type algorithms for solving 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 Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A generic online acceleration scheme for optimization algorithms via relaxation and inertia
- A multiprojection algorithm using Bregman projections in a product space
- A new approach to solving split equality problems in Hilbert spaces
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- A note on the CQ algorithm for the split feasibility problem
- A self-adaptive projection method for solving the multiple-sets split feasibility problem
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Benchmarking optimization software with performance profiles.
- Convex analysis and monotone operator theory in Hilbert spaces
- Dynamic string‐averaging CQ‐methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning
- Fast alternated inertial projection algorithms for pseudo-monotone variational inequalities
- First-order methods in optimization
- FOM -- a MATLAB toolbox of first-order methods for solving convex optimization problems
- Global and linear convergence of alternated inertial methods for split feasibility problems
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- Inertial extragradient algorithms with non-monotone stepsizes for pseudomonotone variational inequalities and applications
- Inertial relaxed \textit{CQ} algorithms for solving a 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
- Matrix p-norms are NP-hard to approximate if p1,2,
- New inertial relaxed method for solving split feasibilities
- Non-convex split Feasibility problems: models, algorithms and theory
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the \(O(1/t)\) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators
- On the proximal gradient algorithm with alternated inertia
- Projection methods with alternating inertial steps for variational inequalities: weak and linear convergence
- Self-adaptive projection and contraction methods with alternated inertial terms for solving the split feasibility problem
- Solving the split feasibility problem without prior knowledge of matrix norms
- Some methods of speeding up the convergence of iteration methods
- Strong convergence result for solving monotone variational inequalities in Hilbert space
- The relaxed CQ algorithm solving the split feasibility problem
- Two optimization approaches for solving split variational inclusion problems with applications
- Weak and strong convergence theorems for fixed points of asymptotically nonexpansive mappings
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
Cited in
(14)- An alternated inertial general splitting method with linearization for the split feasibility problem
- On inertial non-Lipschitz stepsize algorithms for split feasibility problems
- Alternated multi-step inertial iterative algorithm for solving the split feasibility problem in Hilbert spaces
- Multi-step inertial algorithms for equilibrium, fixed point, general systems of variational inequalities and split feasibility problems
- Accelerated projection methods for quasimonotone bilevel variational inequality problems with applications
- CQ-algorithms for the related problems of split equality problem in Hilbert spaces
- Alternated and multi-step inertial algorithm with three-term conjugate gradient-like direction for split feasibilities with applications in classification problems and elastic net
- R-linear and strong convergence of Tseng methods for solving certain split and non-split problems
- Two novel golden ratio algorithms for quasimonotone variational inequalities
- Halpern-type relaxed algorithms with alternated and multi-step inertia for split feasibility problems with applications in classification problems
- An efficient projection method with double alternated inertial extrapolation steps for quasimonotone variational inequalities
- Convergence theorems of hybrid projection algorithms with two inertial terms for solving fixed point problem
- An accelerated relaxed algorithm for the split feasibility problem with multiple output sets in Hilbert spaces
- Linear convergence property of a new projection algorithm for split feasibility problem with multiple output sets
This page was built for publication: Alternated inertial algorithms for split feasibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6140898)
