Polyak's gradient method for split feasibility problem constrained by level sets
From MaRDI portal
Publication:2413285
DOI10.1007/s11075-017-0347-4zbMath1486.65054MaRDI QIDQ2413285
Publication date: 10 April 2018
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-017-0347-4
90C25: Convex programming
47J20: Variational and other types of inequalities involving nonlinear operators (general)
47J25: Iterative procedures involving nonlinear operators
65J15: Numerical solutions to equations with nonlinear operators
49N45: Inverse problems in optimal control
Related Items
Strong convergence of two algorithms for the split feasibility problem in Banach spaces, The ball-relaxed CQ algorithms for the split feasibility problem, An inertial relaxed CQ algorithm with an application to the LASSO and elastic net, Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee, 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, A new inertial self-adaptive gradient algorithm for the split feasibility problem and an application to the sparse recovery problem, A dynamic simultaneous algorithm for solving split equality fixed point problems, A novel projection method for split feasibility problems with applications to compressive sensing, The split common fixed point problem with multiple output sets for strictly pseudo-contractive mappings, ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem, A new self-adaptive CQ algorithm with an application to the LASSO problem, On the shrinking projection method for the split feasibility problem in Banach spaces, General splitting methods with linearization for the split feasibility problem, 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, Strong convergence on the split feasibility problem by mixing \(W\)-mapping, Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces, Alternating iterative algorithms for the split equality problem without prior knowledge of operator norms, The strong convergence of Douglas-Rachford methods for the split feasibility problem, The split feasibility problem with multiple output sets for demicontractive mappings, Linear approximation method for solving split inverse problems and its applications, A generalized self-adaptive algorithm for the split feasibility problem in Banach spaces, Internal perturbation projection algorithm for the extended split equality problem and the extended split equality fixed point problem, 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, Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the convergence of CQ algorithm with variable steps for the split equality problem
- Hilbertian convex feasibility problem: Convergence of projection methods
- Accelerated projected gradient method for linear inverse problems with sparsity constraints
- Properties and iterative methods for the lasso and its variants
- A multiprojection algorithm using Bregman projections in a product space
- A strongly convergent algorithm for the split common fixed point problem
- On variable-step relaxed projection algorithm for variational inequalities
- On split common fixed point problems
- On rings of operators. Reduction theory
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative Algorithms for Nonlinear Operators
- Solving the split feasibility problem without prior knowledge of matrix norms
- Proximity Maps for Convex Sets
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- An iterative regularization method for the solution of the split feasibility problem in Banach spaces
- Probing the Pareto Frontier for Basis Pursuit Solutions
- 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
- Signal Recovery by Proximal Forward-Backward Splitting
- The method of projections for finding the common point of convex sets
- Minimization of unsmooth functionals
- Sparse Image and Signal Processing
