The ball-relaxed CQ algorithms for the split feasibility problem
From MaRDI portal
Publication:4646524
DOI10.1080/02331934.2018.1485677zbMath1490.65106OpenAlexW2810769792MaRDI QIDQ4646524
Hai Yu, Wan-rong Zhan, Feng Hui Wang
Publication date: 14 January 2019
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2018.1485677
Convex programming (90C25) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15) Inverse problems in optimal control (49N45)
Related Items (11)
Ball-relaxed projection algorithms for multiple-sets split feasibility problem ⋮ The ball-relaxed gradient-projection algorithm for 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 ⋮ An inertial accelerated outer quadratic approximation method for split feasibility problem with application to elastic net ⋮ Generalized Halpern iteration with new control conditions and its application ⋮ Global and linear convergence of alternated inertial methods for split feasibility problems ⋮ Strong convergence on the split feasibility problem by mixing \(W\)-mapping ⋮ New inertial relaxed method for solving split feasibilities ⋮ Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces ⋮ An inertial relaxed CQ algorithm with an application to the LASSO and elastic net
Cites Work
- Unnamed Item
- Strong convergence of a relaxed CQ algorithm for the split feasibility problem
- On the convergence of CQ algorithm with variable steps for the split equality problem
- Averaged mappings and the gradient-projection algorithm
- A multiprojection algorithm using Bregman projections in a product space
- A new method for split common fixed-point problem without priori knowledge of operator norms
- On variable-step relaxed projection algorithm for variational inequalities
- Inexact implicit methods for monotone general variational inequalities
- A relaxed alternating CQ-algorithm for convex feasibility problems
- Polyak's gradient method for split feasibility problem constrained by level sets
- A new halfspace-relaxation projection method for the split feasibility problem
- A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Solving the split feasibility problem without prior knowledge of matrix norms
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- 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
- On Projection Algorithms for Solving Convex Feasibility Problems
- The relaxed CQ algorithm solving the split feasibility problem
- Regularization and Variable Selection Via the Elastic Net
- Fast Algorithms for Projection on an Ellipsoid
- A note on the CQ algorithm for the split feasibility problem
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: The ball-relaxed CQ algorithms for the split feasibility problem
