A new CQ method for solving split feasibility problem
From MaRDI portal
Publication:2266829
Recommendations
- A splitting-relaxed projection method for solving the split feasibility problem
- A new algorithm for the split feasibility problem
- Improved relaxed CQ methods for solving the split feasibility problem
- A new iterative method for the split feasibility problem
- A note on the CQ algorithm for the split feasibility problem
Cites work
- A multiprojection algorithm using Bregman projections in a product space
- A note on the CQ algorithm for the split feasibility problem
- Bregman-Legendre multidistance projection algorithms for convex feasibility and optimization
- scientific article; zbMATH DE number 3441150 (Why is no real title available?)
- 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
Cited in
(24)- A linearly convergent algorithm for sparse signal reconstruction
- Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems
- An objective penalty function-based method for inequality constrained minimization problem
- The conjugate gradient viscosity approximation algorithm for split generalized equilibrium and variational inequality problems
- An accelerated symmetric SOR-like method for augmented systems
- An alternating iteration algorithm for solving the split equality fixed point problem with L-Lipschitz and quasi-pseudo-contractive mappings
- 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
- Iterative process for solving a multiple-set split feasibility problem
- Mixed simultaneous iterative algorithms for the extended multiple-set split equality common fixed-point problem with Lipschitz quasi-pseudocontractive operators
- An accelerated augmented Lagrangian method for multi-criteria optimization problem
- New generalized variable stepsizes of the CQ algorithm for solving the split feasibility problem
- A preconditioning method of the CQ algorithm for solving an extended split feasibility problem
- Preconditioning methods for solving a general split feasibility problem
- A dynamical system method for solving the split convex feasibility problem
- Improved relaxed CQ methods for solving the split feasibility problem
- An implementable splitting algorithm for the _1-norm regularized split feasibility problem
- Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces
- A new algorithm for the split feasibility problem
- An unconstrained optimization approach to the split feasibility problem
- High-order copositive tensors and its applications
- scientific article; zbMATH DE number 6025203 (Why is no real title available?)
- Iterative algorithms for finding minimum‐norm fixed point of nonexpansive mappings and applications
This page was built for publication: A new \(CQ\) method for solving split feasibility problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2266829)
