Iterative methods for solving the multiple-sets split feasibility problem with splitting self-adaptive step size

DOI10.1186/s13663-015-0430-2zbMath1338.90309WikidataQ59434097 ScholiaQ59434097MaRDI QIDQ288176

Chuan-Xi Zhu, Hui Yu, Yu-Chao Tang

Publication date: 25 May 2016

Published in: Fixed Point Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s13663-015-0430-2

zbMATH Keywords

compressive sensing; lasso problem; multiple-sets split feasibility problem; self-adaptive step size

Mathematics Subject Classification ID

90C25: Convex programming

90C30: Nonlinear programming

47J25: Iterative procedures involving nonlinear operators

Related Items

A relaxed CQ algorithm involving the alternated inertial technique for the multiple-sets split feasibility problem, Convergence analysis of an iterative method for solving multiple-set split feasibility problems in certain Banach spaces, ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem, Note on the modified relaxation CQ algorithm for the split feasibility problem, Linear approximation method for solving split inverse problems and its applications, Iterative regularization methods for the multiple-sets split feasibility problem in Hilbert spaces

Uses Software

• PDCO

Cites Work

• Unnamed Item
• Several acceleration schemes for solving the multiple-sets split feasibility problem
• A cyclic and simultaneous iterative method for solving the multiple-sets split feasibility problem
• Properties and iterative methods for the lasso and its variants
• A multiprojection algorithm using Bregman projections in a product space
• On variable-step relaxed projection algorithm for variational inequalities
• Self-adaptive and relaxed self-adaptive projection methods for solving the multiple-set split feasibility problem
• Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
• Self-adaptive projection method for co-coercive variational inequalities
• A simple projection method for solving the multiple-sets split feasibility problem
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• Self-adaptive projection methods for the multiple-sets split feasibility problem
• Solving the split feasibility problem without prior knowledge of matrix norms
• The multiple-sets split feasibility problem and its applications for inverse problems
• A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
• A self-adaptive projection method for solving the multiple-sets split feasibility problem
• Monotone Operators and the Proximal Point Algorithm
• Atomic Decomposition by Basis Pursuit
• 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
• A note on the CQ algorithm for the split feasibility problem
• Convex analysis and monotone operator theory in Hilbert spaces