Inertial accelerated algorithms for solving a split feasibility problem
From MaRDI portal
Publication:2397577
DOI10.3934/jimo.2016078zbMath1362.65061OpenAlexW2531606666MaRDI QIDQ2397577
Honglei Xu, Jie Sun, Ya-Zheng Dang
Publication date: 22 May 2017
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2016078
nonsmooth analysissubdifferentialsplit feasibility probleminertial techniqueasymptotical convergence
Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52)
Related Items
An inertial based forward-backward algorithm for monotone inclusion problems and split mixed equilibrium problems in Hilbert spaces ⋮ Solving a split feasibility problem by the strong convergence of two projection algorithms in Hilbert spaces ⋮ Ball-relaxed projection algorithms for multiple-sets split feasibility problem ⋮ An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces ⋮ Accelerated cyclic iterative algorithms for the multiple-set split common fixed-point problem of quasi-nonexpansive operators ⋮ A relaxed projection method using a new linesearch for the split feasibility problem ⋮ 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 ⋮ Applications of accelerated computational methods for quasi-nonexpansive operators to optimization problems ⋮ On a system of monotone variational inclusion problems with fixed-point constraint ⋮ Strong convergence analysis of common variational inclusion problems involving an inertial parallel monotone hybrid method for a novel application to image restoration ⋮ New Self-Adaptive Algorithms and Inertial Self-Adaptive Algorithms for the Split Variational Inclusion Problems in Hilbert Space ⋮ Relaxed successive projection algorithm with strong convergence for the multiple-sets split equality 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 ⋮ An inertial method for solving split common fixed point 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 ⋮ Inertial-based extragradient algorithm for approximating a common solution of split-equilibrium problems and fixed-point problems of nonexpansive semigroups ⋮ A relaxed inertial and viscosity method for split feasibility problem and applications to image recovery ⋮ Empirical analysis and optimization of capital structure adjustment ⋮ Self-adaptive algorithms for solving split feasibility problem with multiple output sets ⋮ On some novel methods for solving the generalized Fermat-Torricelli problem in Hilbert spaces ⋮ An accelerate algorithm for the split equality common fixed-point problem of directed operators ⋮ Convergence analysis for solving equilibrium problems and split feasibility problems in Hilbert spaces ⋮ Unnamed Item ⋮ 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 ⋮ Two general splitting methods with alternated inertia for solving split equality problem in Hilbert spaces ⋮ Inertial Mann-type iterative method for solving split monotone variational inclusion problem with applications ⋮ Unnamed Item ⋮ A modified inertial shrinking projection method for solving inclusion problems and quasi-nonexpansive multivalued mappings ⋮ Shrinking projection methods for accelerating relaxed inertial Tseng-type algorithm with applications ⋮ An inertial forward-backward splitting method for solving combination of equilibrium problems and inclusion problems ⋮ Global and linear convergence of alternated inertial methods for split feasibility problems ⋮ Relaxed inertial accelerated algorithms for solving split equality feasibility problem ⋮ An inertial forward-backward splitting method for solving inclusion problems in Hilbert spaces ⋮ On inertial proximal algorithm for split variational inclusion problems ⋮ Effect of shrinking projection and CQ-methods on two inertial forward-backward algorithms for solving variational inclusion problems ⋮ Modified hybrid projection methods with SP iterations for quasi-nonexpansive multivalued mappings in Hilbert spaces ⋮ A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems ⋮ A new CQ algorithm for solving split feasibility problems in Hilbert spaces ⋮ 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 ⋮ New inertial relaxed method for solving split feasibilities ⋮ A Levenberg-Marquardt method for solving the tensor split feasibility problem ⋮ Strong convergence of alternated inertial \(CQ\) relaxed method with application in signal recovery ⋮ A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications ⋮ Shrinking projection methods involving inertial forward-backward splitting methods for inclusion problems ⋮ Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems ⋮ A method with inertial extrapolation step for split monotone inclusion problems ⋮ Weak and strong convergence of inertial algorithms for solving split common fixed point problems ⋮ The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem ⋮ Proximal type algorithms involving linesearch and inertial technique for split variational inclusion problem in hilbert spaces with applications ⋮ 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 ⋮ An inertial triple-projection algorithm for solving the split feasibility problem ⋮ Image restoration by advanced parallel inertial forward-backward splitting methods ⋮ Weak and strong convergence results for the modified Noor iteration of three quasi-nonexpansive multivalued mappings in Hilbert spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the convergence of a class of outer approximation algorithms for convex programs
- Inertial iterative process for fixed points of certain quasi-nonexpansive mappings
- Convergence theorems for inertial KM-type algorithms
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- A multiprojection algorithm using Bregman projections in a product space
- Robust solutions of split feasibility problem with uncertain linear operator
- A new halfspace-relaxation projection method for the split feasibility problem
- The Constraint Consensus Method for Finding Approximately Feasible Points in Nonlinear Programs
- The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
- The multiple-sets split feasibility problem and its applications for inverse problems
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Optimization and nonsmooth analysis
- A relaxed projection method for variational inequalities
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- On the Minimizing Property of a Second Order Dissipative System in Hilbert Spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space
- On Projection Algorithms for Solving Convex Feasibility Problems
- The relaxed CQ algorithm solving the split feasibility problem
- A Geometrical Look at Iterative Methods for Operators with Fixed Points
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- Several solution methods for the split feasibility problem
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping