A new \(CQ\) method for solving split feasibility problem

DOI10.1007/S11464-009-0047-ZzbMath1187.90282OpenAlexW1991115745MaRDI QIDQ2266829

Y. J. Wang, Hong-yu Zhang

Publication date: 26 February 2010

Published in: Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11464-009-0047-z

zbMATH Keywords

convergenceprojection methodsplit feasibility problem (SFP)

Mathematics Subject Classification ID

Nonlinear programming (90C30) Linear equations (linear algebraic aspects) (15A06)

Related Items (15)

A linearly convergent algorithm for sparse signal reconstruction ⋮ An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem ⋮ Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems ⋮ Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces ⋮ High-order sum-of-squares structured tensors: theory and applications ⋮ Internal perturbation projection algorithm for the extended split equality problem and the extended split equality fixed point problem ⋮ A Shamanskii-like self-adaptive Levenberg-Marquardt method for nonlinear equations ⋮ An objective penalty function-based method for inequality constrained minimization problem ⋮ HIGH-ORDER COPOSITIVE TENSORS AND ITS APPLICATIONS ⋮ The conjugate gradient viscosity approximation algorithm for split generalized equilibrium and variational inequality problems ⋮ Iterative algorithms for finding minimum‐norm fixed point of nonexpansive mappings and applications ⋮ An accelerated symmetric SOR-like method for augmented systems ⋮ Mixed simultaneous iterative algorithms for the extended multiple-set split equality common fixed-point problem with Lipschitz quasi-pseudocontractive operators ⋮ An alternating iteration algorithm for solving the split equality fixed point problem with L-Lipschitz and quasi-pseudo-contractive mappings ⋮ An accelerated augmented Lagrangian method for multi-criteria optimization problem

Cites Work

• Unnamed Item
• Unnamed Item
• A multiprojection algorithm using Bregman projections in a product space
• 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
• A note on the CQ algorithm for the split feasibility problem

This page was built for publication: A new \(CQ\) method for solving split feasibility problem