New inertial relaxed method for solving split feasibilities

DOI10.1007/s11590-020-01603-1zbMath1475.90061OpenAlexW3033886262MaRDI QIDQ2047200

Aviv Gibali, Yekini Shehu

Publication date: 19 August 2021

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-020-01603-1

zbMATH Keywords

signal processingsplit feasibility problemsalternated inertialCQ methods

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90)

Related Items

Self-adaptive inertial single projection methods for variational inequalities involving non-Lipschitz and Lipschitz operators with their applications to optimal control problems, Inertial extragradient algorithms with non-monotone stepsizes for pseudomonotone variational inequalities and applications, The ball-relaxed gradient-projection algorithm for split feasibility problem, A relaxed CQ algorithm involving the alternated inertial technique for the multiple-sets split feasibility problem, Viscosity and inertial algorithms for the split common fixed point problem with applications to compressed sensing, Convergence analysis of new inertial method for the split common null point problem, 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, Linear approximation method for solving split inverse problems and its applications, Revisiting subgradient extragradient methods for solving variational inequalities, Strong convergence of self-adaptive inertial algorithms for solving split variational inclusion problems with applications, Two modified inertial projection algorithms for bilevel pseudomonotone variational inequalities with applications to optimal control problems, A new iterative method with alternated inertia for the split feasibility problem, A hierarchical variational inequality problem for generalized demimetric mappings with applications, Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration, Inertial relaxed CQ algorithm for split feasibility problems with non-Lipschitz gradient operators, A new Bregman projection method with a self-adaptive process for solving variational inequality problem in reflexive Banach spaces, Modified relaxed CQ methods for the split feasibility problems in Hilbert spaces with applications, An alternated inertial general splitting method with linearization for the split feasibility problem, Two inertial-type algorithms for solving the split feasibility problem, Inertial-based extragradient algorithm for approximating a common solution of split-equilibrium problems and fixed-point problems of nonexpansive semigroups, Perturbation Resilience of Self-Adaptive Step-Size Algorithms for Solving Split Variational Inclusion Problems and their Applications, An accelerate algorithm for the split equality common fixed-point problem of directed operators, Alternated and multi-step inertial approximation methods for solving convex bilevel optimization problems, Modified inertial extragradient methods for finding minimum-norm solution of the variational inequality problem with applications to optimal control problem, Convergence analysis for solving equilibrium problems and split feasibility problems in Hilbert spaces, Alternated inertial algorithms for split feasibility problems, Modified inertial projection and contraction algorithms with non-monotonic step sizes for solving variational inequalities and their applications, A novel projection method for split feasibility problems with applications to compressive sensing, Adaptive inertial subgradient extragradient methods for finding minimum-norm solutions of pseudomonotone variational inequalities, Adaptive hybrid steepest descent algorithms involving an inertial extrapolation term for split monotone variational inclusion problems, Inertial‐like Bregman projection method for solving systems of variational inequalities, Unnamed Item, Global and linear convergence of alternated inertial methods for split feasibility problems, Unnamed Item, An accelerated extragradient algorithm for bilevel pseudomonotone variational inequality problems with application to optimal control problems, 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, Self adaptive inertial extragradient algorithms for solving bilevel pseudomonotone variational inequality problems, On modified subgradient extragradient methods for pseudomonotone variational inequality problems with applications, SELF ADAPTIVE VISCOSITY-TYPE INERTIAL EXTRAGRADIENT ALGORITHMS FOR SOLVING VARIATIONAL INEQUALITIES WITH APPLICATIONS, Strong convergence of alternated inertial \(CQ\) relaxed method with application in signal recovery, The iterative method for solving the proximal split feasibility problem with an application to LASSO problem, Modified inertial projection and contraction algorithms for solving variational inequality problems with non-Lipschitz continuous operators, New inertial proximal gradient methods for unconstrained convex optimization problems, Two projection-based methods for bilevel pseudomonotone variational inequalities involving non-Lipschitz operators, The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem, Unnamed Item, Strong convergence of inertial projection and contraction methods for pseudomonotone variational inequalities with applications to optimal control problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems
• Inertial Douglas-Rachford splitting for monotone inclusion problems
• An iterative algorithm for solving split feasibility problems and fixed point problems in Banach spaces
• 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
• Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
• Inertial iterative process for fixed points of certain quasi-nonexpansive mappings
• An inertial forward-backward algorithm for monotone inclusions
• An iterative row-action method for interval convex programming
• A multiprojection algorithm using Bregman projections in a product space
• Note on the modified relaxation CQ algorithm for the split feasibility problem
• Convergence analysis for the proximal split feasibility problem using an inertial extrapolation term method
• On the proximal gradient algorithm with alternated inertia
• Convergence of a splitting inertial proximal method for monotone operators
• A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems
• Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
• Double projection algorithms for solving the split feasibility problems
• Inertial accelerated algorithms for solving a split feasibility problem
• An inertial alternating direction method of multipliers
• 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
• Matrix p-Norms Are NP-Hard to Approximate If $p\neq1,2,\infty$
• Solving the split feasibility problem without prior knowledge of matrix norms
• The multiple-sets split feasibility problem and its applications for inverse problems
• An iterative regularization method for the solution of the split feasibility problem in Banach spaces
• A relaxed projection method for variational inequalities
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Iterative oblique projection onto convex sets and the split feasibility problem
• A First-Order Primal-Dual Algorithm with Linesearch
• A generic online acceleration scheme for optimization algorithms via relaxation and inertia
• The ball-relaxed CQ algorithms for the split feasibility problem
• On Projection Algorithms for Solving Convex Feasibility Problems
• The relaxed CQ algorithm solving the split feasibility problem
• Accelerated alternating minimization algorithm for Poisson noisy image recovery
• Extragradient and linesearch methods for solving split feasibility problems in Hilbert spaces
• A projected subgradient-proximal method for split equality equilibrium problems of pseudomonotone bifunctions in Banach spaces
• Hybrid inertial proximal algorithm for the split variational inclusion problem in Hilbert spaces with applications
• Some methods of speeding up the convergence of iteration methods
• A note on the CQ algorithm for the split feasibility problem
• Convex analysis and monotone operator theory in Hilbert spaces
• An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping