The iterative method for solving the proximal split feasibility problem with an application to LASSO problem
From MaRDI portal
Publication:2064973
DOI10.1007/s40314-021-01703-3zbMath1483.47099OpenAlexW4200405412MaRDI QIDQ2064973
Publication date: 6 January 2022
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-021-01703-3
strong convergencereal Hilbert spacelasso problemproximal split feasibility problemfirmly nonexpansive operatorsviscosity-type method
Variational and other types of inequalities involving nonlinear operators (general) (47J20) Variational inequalities (49J40) Iterative procedures involving nonlinear operators (47J25) Variational methods applied to PDEs (35A15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem
- Solving proximal split feasibility problems without prior knowledge of operator norms
- An algorithm for a class of split feasibility problems: application to a model in electricity production
- Approximation of zeros of inverse strongly monotone operators in Banach spaces
- ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
- A multiprojection algorithm using Bregman projections in a product space
- A new self-adaptive CQ algorithm with an application to the LASSO problem
- 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
- An inertial type iterative method with Armijo linesearch for nonmonotone equilibrium problems
- Iterative methods for solving proximal split minimization problems
- Viscosity approximation methods for fixed-points problems
- General splitting methods with linearization for the split feasibility problem
- An optimization approach to solving the split feasibility problem 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
- Iterative method with inertial terms for nonexpansive mappings: applications to compressed sensing
- On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
- A subgradient algorithm for a class of nonlinear split feasibility problems: application to jointly constrained Nash equilibrium models
- Solving the split feasibility problem without prior knowledge of matrix norms
- The multiple-sets split feasibility problem and its applications for inverse problems
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- Strong convergence result for proximal split feasibility problem in Hilbert spaces
- Nonlinear iteration method for proximal split feasibility problems
- Accelerated hybrid viscosity and steepest-descent method for proximal split feasibility problems
- Proximal type algorithms involving linesearch and inertial technique for split variational inclusion problem in hilbert spaces with applications
- Signal Recovery by Proximal Forward-Backward Splitting
- A note on the CQ algorithm for the split feasibility problem
