A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications

DOI10.3934/jimo.2018080zbMath1438.65124OpenAlexW2806250703WikidataQ128133839 ScholiaQ128133839MaRDI QIDQ2313782

Aviv Gibali, Nguyen The Vinh, Dang Thi Mai

Publication date: 23 July 2019

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2018080

zbMATH Keywords

strong convergenceweak convergencesplit feasibility problemCQ algorithmself-adaptive algorithminertial techniqueLasso problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52)

Related Items

New iterative algorithms with self-adaptive step size for solving split equality fixed point problem and its applications ⋮ An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces ⋮ 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 ⋮ Non-convex split Feasibility problems: models, algorithms and theory ⋮ Strong convergence of self-adaptive inertial algorithms for solving split variational inclusion problems with applications ⋮ A new iterative method with alternated inertia for the split feasibility problem ⋮ A dynamical system method for solving the split convex feasibility problem ⋮ Several inertial methods for solving split convex feasibilities and related problems ⋮ Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration ⋮ Self-adaptive forward-backward contraction-type methods for generalized split feasibility problems ⋮ Inertial relaxed CQ algorithm for split feasibility problems with non-Lipschitz gradient operators ⋮ 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 ⋮ An intermixed method for solving the combination of mixed variational inequality problems and fixed-point problems ⋮ Self-adaptive algorithms for solving split feasibility problem with multiple output sets ⋮ Convergence analysis for solving equilibrium problems and split feasibility problems in Hilbert spaces ⋮ Alternated inertial algorithms for split feasibility problems ⋮ Bounded perturbation resilience of viscosity proximal algorithm for solving split variational inclusion problems with applications to compressed sensing and image recovery ⋮ A new inertial self-adaptive gradient algorithm for the split feasibility problem and an application to the sparse recovery problem ⋮ A novel projection method for split feasibility problems with applications to compressive sensing ⋮ Adaptive hybrid steepest descent algorithms involving an inertial extrapolation term for split monotone variational inclusion problems ⋮ An inertial accelerated outer quadratic approximation method for split feasibility problem with application to elastic net ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An inertial method for split common fixed point problems in Hilbert spaces ⋮ A strongly convergent Mann-type inertial algorithm for solving split variational inclusion 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 ⋮ An inertial extrapolation method for solving generalized split feasibility problems in real Hilbert spaces ⋮ 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 ⋮ Convergence analysis of a new iterative algorithm for solving split variational inclusion problems ⋮ Self adaptive inertial relaxed \(CQ\) algorithms for solving split feasibility problem with multiple output sets ⋮ An inertial relaxed CQ algorithm with an application to the LASSO and elastic net ⋮ Inertial accelerated algorithms for the split common fixed-point problem of directed operators ⋮ Unnamed Item ⋮ An inertial triple-projection algorithm for solving the split feasibility problem

Uses Software

• PDCO
• AIR tools

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cyclic algorithms for split feasibility problems in Hilbert spaces
• An extragradient method for solving split feasibility and fixed point problems
• Approximation methods for common fixed points of nonexpansive mappings in Hilbert spaces
• Convergence theorems for inertial KM-type algorithms
• Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
• A multiprojection algorithm using Bregman projections in a product space
• Totally convex functions for fixed points computation and infinite dimensional optimization
• \(l_1\)-\(l_2\) regularization of split feasibility problems
• 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
• Fast L1-L2 minimization via a proximal operator
• A network flow algorithm for reconstructing binary images from discrete X-rays
• Inertial accelerated algorithms for solving a split feasibility problem
• Adaptively relaxed algorithms for solving the split feasibility problem with a new step size
• Polyak's gradient method for split feasibility problem constrained by level sets
• AIR tools -- a MATLAB package of algebraic iterative reconstruction methods
• 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
• Iterative Algorithms for Nonlinear Operators
• Solving the split feasibility problem without prior knowledge of matrix norms
• The multiple-sets split feasibility problem and its applications for inverse problems
• Atomic Decomposition by Basis Pursuit
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Iterative oblique projection onto convex sets and the split feasibility problem
• Accelerated hybrid viscosity and steepest-descent method for proximal split feasibility problems
• On Projection Algorithms for Solving Convex Feasibility Problems
• The relaxed CQ algorithm solving the split feasibility problem
• DC-Programming versus ℓ₀-Superiorization for Discrete Tomography
• Split Feasibility and Fixed Point Problems
• Weak convergence of the sequence of successive approximations for nonexpansive mappings
• An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping

This page was built for publication: A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications