A note on approximating curve with 1-norm regularization method for the split feasibility problem
From MaRDI portal
Publication:1760799
DOI10.1155/2012/683890zbMath1251.65083OpenAlexW1994253448WikidataQ58907135 ScholiaQ58907135MaRDI QIDQ1760799
Publication date: 15 November 2012
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/683890
Related Items (3)
Iterative algorithm for the split equality problem in Hilbert spaces ⋮ An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem ⋮ Fast self-adaptive regularization iterative algorithm for solving split feasibility problem
Cites Work
- Unnamed Item
- Unnamed Item
- Regularized methods for the split feasibility problem
- Applications of fixed-point and optimization methods to the multiple-set split feasibility problem
- Cyclic algorithms for split feasibility problems in Hilbert spaces
- Averaged mappings and the gradient-projection algorithm
- Implicit and explicit algorithms for solving the split feasibility problem
- Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
- 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
- 1-Norm-based regularization scheme for system identification of structures with discontinuous system parameters
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- The relaxed CQ algorithm solving the split feasibility problem
- Generalized KM theorems and their applications
- A note on the CQ algorithm for the split feasibility problem
This page was built for publication: A note on approximating curve with 1-norm regularization method for the split feasibility problem