Fast self-adaptive regularization iterative algorithm for solving split feasibility problem
From MaRDI portal
Publication:2190288
DOI10.3934/jimo.2019017zbMath1449.90285OpenAlexW2921341648WikidataQ128151280 ScholiaQ128151280MaRDI QIDQ2190288
Yan Gao, Zhong-Hui Xue, Jun-Xiang Li, Ya-Zheng Dang
Publication date: 18 June 2020
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2019017
regularizationimage deblurringiteration complexitysplit feasible problemArmijo-like searchaccelerated iterative algorithm
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- An implementable splitting algorithm for the \(\ell_1\)-norm regularized 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
- A note on approximating curve with 1-norm regularization method for the split feasibility problem
- Convexly constrained linear inverse problems: iterative least-squares and regularization
- The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Deblurring Images
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- 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
- Iterative Solution of Nonlinear Equations in Several Variables
- A note on the CQ algorithm for the split feasibility problem
- Several solution methods for the split feasibility problem
This page was built for publication: Fast self-adaptive regularization iterative algorithm for solving split feasibility problem
