Hybrid simultaneous algorithms for the split equality problem with applications
DOI10.1186/S13660-016-1141-XzbMATH Open1346.49049OpenAlexW2518314934WikidataQ59461348 ScholiaQ59461348MaRDI QIDQ308169FDOQ308169
Authors: Chih-Sheng Chuang, Wei-Shih Du
Publication date: 5 September 2016
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-016-1141-x
Recommendations
- Simultaneous and semi-alternating projection algorithms for solving split equality problems
- An algorithm for the split-feasibility problems with application to the split-equality problem
- Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces
- The strongly convergent relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces
- A projected Landweber method with variable steps for the split equality problem
Convex programming (90C25) Numerical methods based on nonlinear programming (49M37) Variational inequalities (49J40) Set-valued and variational analysis (49J53) Inverse problems in optimal control (49N45) Numerical methods for variational inequalities and related problems (65K15)
Cites Work
- A multiprojection algorithm using Bregman projections in a product space
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Iterative oblique projection onto convex sets and the split feasibility problem
- A note on the multiple-set split convex feasibility problem in Hilbert space
- On variable-step relaxed projection algorithm for variational inequalities
- A relaxed alternating CQ-algorithm for convex feasibility problems
- The strong convergence of a KM-CQ-like algorithm for a split feasibility problem
- Self-adaptive projection methods for the multiple-sets split feasibility problem
- Introduction to nonlinear and convex analysis
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- The relaxed CQ algorithm solving the split feasibility problem
- A note on the CQ algorithm for the split feasibility problem
- Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
- Title not available (Why is that?)
- Alternating proximal algorithms for weakly coupled convex minimization problems. Applications to dynamical games and PDE's
- Extensions of the CQ algorithm for the split feasibility and split equality problems
- Regularization method for the approximate split equality problem in infinite-dimensional Hilbert spaces
- Title not available (Why is that?)
- Solving the split equality problem without prior knowledge of operator norms
- A gradient projection method for solving split equality and split feasibility problems in Hilbert spaces
Cited In (6)
- Title not available (Why is that?)
- Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces
- An algorithm for the split-feasibility problems with application to the split-equality problem
- The strongly convergent 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
- Simultaneous and semi-alternating projection algorithms for solving split equality problems
This page was built for publication: Hybrid simultaneous algorithms for the split equality problem with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q308169)