A note on approximating curve with 1-norm regularization method for the split feasibility problem
type: Item
instance of: scholarly article
title: A note on approximating curve with 1-norm regularization method for the split feasibility problem
zbMATH Open document ID: 1251.65083
DOI: 10.1155/2012/683890
author: Songnian He
author: Wenlong Zhu
published in: Journal of Applied Mathematics
publication date: 2012-11-15T00:00:00Z
review text: Summary: Inspired by the very recent results of \textit{F. Wang} and \textit{H.-K. Xu} [Nonlinear Anal., Theory Methods Appl., Ser. A, Theory Methods 74, No. 12, 4105--4111 (2011; Zbl 1308.47079)], we study properties of the approximating curve with 1-norm regularization method for the split feasibility problem (SFP). The concept of the minimum-norm solution set of SFP in the sense of 1-norm is proposed, and the relationship between the approximating curve and the minimum-norm solution set is obtained.
Mathematics Subject Classification ID: 65J15
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 6106283
zbMATH Keywords: approximating curve
zbMATH Keywords: split feasibility problem
Wikidata QID: Q58907135
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2012/683890
OpenAlex ID: W1994253448
cites work: A multiprojection algorithm using Bregman projections in a product space
cites work: Applications of fixed-point and optimization methods to the multiple-set split feasibility problem
cites work: Iterative oblique projection onto convex sets and the split feasibility problem
cites work: A unified treatment of some iterative algorithms in signal processing and image reconstruction
cites work: A note on the CQ algorithm for the split feasibility problem
cites work: A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
cites work: The relaxed CQ algorithm solving the split feasibility problem
cites work: Generalized KM theorems and their applications
cites work: Regularized methods for the split feasibility problem
cites work: Implicit and explicit algorithms for solving the split feasibility problem
cites work: Cyclic algorithms for split feasibility problems in Hilbert spaces
cites work: Averaged mappings and the gradient-projection algorithm
cites work: Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
cites work: Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
cites work: 1-Norm-based regularization scheme for system identification of structures with discontinuous system parameters
cites work: Q4695312
cites work: Q4895893
Recommended article: An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem
Recommended article: Regularized methods for the split feasibility problem
Recommended article: \(l_1\)-\(l_2\) regularization of split feasibility problems
Recommended article: Regularization for the split feasibility problem
Recommended article: Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
Recommended article: A regularization algorithm for a splitting feasibility problem in Hilbert spaces
Recommended article: A regularized algorithm for the proximal split feasibility problem
Recommended article: Q4908008
Recommended article: The Split Bregman Method for L1-Regularized Problems
Recommended article: An iterative regularization method for the solution of the split feasibility problem in Banach spaces
description: scientific article; zbMATH DE number 6106283