Polyak's gradient method for split feasibility problem constrained by level sets

DOI10.1007/S11075-017-0347-4MaRDI QIDQ2413285zbMATH OpenOpenAlexFDO

Authors Fenghui Wang

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

zbMATH Keywords

CQ algorithmlevel setsprojection algorithmssplit feasibility problem

Mathematics Subject Classification ID

Variational and other types of inequalities involving nonlinear operators (general) (47J20) Iterative procedures involving nonlinear operators (47J25) Inverse problems in optimal control (49N45) Numerical solutions to equations with nonlinear operators (65J15) Convex programming (90C25)

Recommendations

• The ball-relaxed gradient-projection algorithm for split feasibility problem
• Gradient methods with selection technique for the multiple-sets split feasibility problem
• Gradient projection method with a new step size for the split feasibility problem
• On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
• A note on the multiple-set split convex feasibility problem in Hilbert space

Cites work

• A multiprojection algorithm using Bregman projections in a product space
• A relaxed projection method for variational inequalities
• A strongly convergent algorithm for the split common fixed point 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
• Accelerated projected gradient method for linear inverse problems with sparsity constraints
• An iterative regularization method for the solution of the split feasibility problem in Banach spaces
• Hilbertian convex feasibility problem: Convergence of projection methods
• scientific article; zbMATH DE number 3214008 (Why is no real title available?)
• scientific article; zbMATH DE number 3230744 (Why is no real title available?)
• 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
• Minimization of unsmooth functionals
• On Projection Algorithms for Solving Convex Feasibility Problems
• On rings of operators. Reduction theory
• On split common fixed point problems
• On the convergence of CQ algorithm with variable steps for the split equality problem
• On variable-step relaxed projection algorithm for variational inequalities
• Probing the Pareto frontier for basis pursuit solutions
• Properties and iterative methods for the lasso and its variants
• Proximity Maps for Convex Sets
• Signal Recovery by Proximal Forward-Backward Splitting
• Solving the split feasibility problem without prior knowledge of matrix norms
• Sparse image and signal processing. Wavelets, curvelets, morphological diversity
• The method of projections for finding the common point of convex sets
• The relaxed CQ algorithm solving the split feasibility problem

Cited in

(44)

• 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
• The ball-relaxed gradient-projection algorithm for split feasibility problem
• 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
• scientific article; zbMATH DE number 7399383 (Why is no real title available?)
• 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
• The split feasibility problem with polynomials
• 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
• A Viscosity Iterative Method with Alternated Inertial Terms for Solving the Split Feasibility Problem
• A new relaxed method for the split feasibility problem in Hilbert spaces
• The split common fixed point problem with multiple output sets for demicontractive mappings
• A novel stepsize for gradient descent method
• Modified general splitting method for the split feasibility problem
• Alternated multi-step inertial iterative algorithm for solving the split feasibility problem in Hilbert spaces
• Strong convergence of Bregman projection algorithms for solving split feasibility problems
• A moving ball projection algorithm for the split feasibility problem
• Halpern-type Bregman projection algorithms for split variational inequality problems
• An inertial hyperplane projection method for split feasibility problems and applications
• Pre-conditioning CQ algorithm for solving the split feasibility problem and its application to image restoration problem
• An inertial method for solving the split equality fixed point problem with multiple output sets
• Korpelevich's extragradient method for split common fixed point problems in Hilbert space
• Algorithms and applications for split equality problem with related problems
• ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
• Preconditioning splitting methods for the split feasibility problem

Describes a project that uses

Uses Software

• SPGL1

This page was built for publication: Polyak's gradient method for split feasibility problem constrained by level sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2413285)