A new self-adaptive CQ algorithm with an application to the LASSO problem
From MaRDI portal
Publication:1615350
DOI10.1007/s11784-018-0620-8zbMath1398.65149OpenAlexW2889882686WikidataQ129208151 ScholiaQ129208151MaRDI QIDQ1615350
Vu Tien Dung, Pham Ky Anh, Nguyen The Vinh
Publication date: 30 October 2018
Published in: Journal of Fixed Point Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11784-018-0620-8
strong convergenceweak convergencevariational inequalitymonotone operatorsplit feasibility problemfixed point problem
Iterative procedures involving nonlinear operators (47J25) Numerical methods for variational inequalities and related problems (65K15)
Related Items
An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces ⋮ Inertial relaxed CQ algorithm for split feasibility problems with non-Lipschitz gradient operators ⋮ Convergence analysis for solving equilibrium problems and split feasibility problems in Hilbert spaces ⋮ A novel projection method for split feasibility problems with applications to compressive sensing ⋮ An algorithm for the split feasible problem and image restoration ⋮ 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 ⋮ Modified forward-backward splitting method for variational inclusions ⋮ 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 ⋮ Self adaptive inertial relaxed \(CQ\) algorithms for solving split feasibility problem with multiple output sets
Cites Work
- Unnamed Item
- 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
- Convergence of direct methods for paramonotone variational inequalities
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process
- 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
- Forcing strong convergence of proximal point iterations in a Hilbert space
- Polyak's gradient method for split feasibility problem constrained by level sets
- Strong convergence of the CQ method for fixed point iteration processes
- 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
- An explicit algorithm for monotone variational inequalities
- Solving the split feasibility problem without prior knowledge of matrix norms
- The multiple-sets split feasibility problem and its applications for inverse problems
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- The relaxed CQ algorithm solving the split feasibility problem
- Split Feasibility and Fixed Point Problems
- A note on the CQ algorithm for the split feasibility problem
