An inertial hyperplane projection method for split feasibility problems and applications
From MaRDI portal
Cites work
- \(l_1\)-\(l_2\) regularization of split feasibility problems
- A multiprojection algorithm using Bregman projections in a product space
- A new CQ algorithm for solving split feasibility problems in Hilbert spaces
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- A new self-adaptive CQ algorithm with an application to the LASSO problem
- A note on the CQ algorithm for the split feasibility problem
- A novel projection method for split feasibility problems with applications to compressive sensing
- A self-adaptive projection-type method for nonlinear multiple-sets split feasibility problem
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces
- An inertial relaxed CQ algorithm with an application to the LASSO and elastic net
- Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process
- Approximation methods for common fixed points of nonexpansive mappings in Hilbert spaces
- First-order methods in optimization
- General splitting methods with linearization for the split feasibility problem
- Global and linear convergence of alternated inertial methods for split feasibility problems
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 3853749 (Why is no real title available?)
- Inertial accelerated algorithms for solving a split feasibility problem
- Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration
- Iterative Algorithms for Nonlinear Operators
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- New inertial relaxed method for solving split feasibilities
- Non-convex split Feasibility problems: models, algorithms and theory
- On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
- On variable-step relaxed projection algorithm for variational inequalities
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
- Polyak's gradient method for split feasibility problem constrained by level sets
- Self-adaptive projection methods for the multiple-sets split feasibility problem
- Solving the split feasibility problem without prior knowledge of matrix norms
- Some subgradient extragradient type algorithms for solving split feasibility and fixed point problems
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- The multiple-sets split feasibility problem and its applications for inverse problems
- The relaxed CQ algorithm solving the split feasibility problem
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
Cited in
(1)
This page was built for publication: An inertial hyperplane projection method for split feasibility problems and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6912904)
