A note on approximating curve with 1-norm regularization method for the split feasibility problem

DOI10.1155/2012/683890MaRDI QIDQ1760799zbMATH OpenOpenAlexWikidataFDO

Authors Songnian He, Wenlong Zhu

Publication date 15 November 2012

Published in Journal of Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2012/683890

zbMATH Keywords

approximating curvesplit feasibility problem

Mathematics Subject Classification ID

Numerical solutions to equations with nonlinear operators (65J15) Convex programming (90C25)

Recommendations

• An implementable splitting algorithm for the _1-norm regularized split feasibility problem
• Regularized methods for the split feasibility problem
• \(l_1\)-\(l_2\) regularization of split feasibility problems
• Regularization for the split feasibility problem
• Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
• A regularization algorithm for a splitting feasibility problem in Hilbert spaces
• A regularized algorithm for the proximal split feasibility problem
• A hybrid extragradient-like approximation method with regularization for solving split feasibility and fixed point problems
• The Split Bregman Method for L1-Regularized Problems
• An iterative regularization method for the solution of the split feasibility problem in Banach spaces

Cites work

• 1-norm-based regularization scheme for system identification of structures with discontinuous system parameters
• A multiprojection algorithm using Bregman projections in a product space
• A note on the CQ algorithm for the split feasibility problem
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
• Applications of fixed-point and optimization methods to the multiple-set split feasibility problem
• Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
• Averaged mappings and the gradient-projection algorithm
• Cyclic algorithms for split feasibility problems in Hilbert spaces
• Generalized KM theorems and their applications
• scientific article; zbMATH DE number 204196 (Why is no real title available?)
• scientific article; zbMATH DE number 936298 (Why is no real title available?)
• Implicit and explicit algorithms for solving the split feasibility problem
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• Iterative oblique projection onto convex sets and the split feasibility problem
• Regularized methods for the split feasibility problem
• The relaxed CQ algorithm solving the split feasibility problem

Cited in

(4)

• Fast self-adaptive regularization iterative algorithm for solving split feasibility problem
• Iterative algorithm for the split equality problem in Hilbert spaces
• An implementable splitting algorithm for the _1-norm regularized split feasibility problem
• A proximal alternating direction method of multipliers for DC programming with structured constraints

This page was built for publication: A note on approximating curve with 1-norm regularization method for the split feasibility problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1760799)