Fast self-adaptive regularization iterative algorithm for solving split feasibility problem

DOI10.3934/JIMO.2019017MaRDI QIDQ2190288zbMATH OpenOpenAlexWikidataFDO

Authors Zhonghui Xue, Yan Gao, Junxiang Li, Yazheng 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

zbMATH Keywords

regularizationimage deblurringiteration complexitysplit feasible problemArmijo-like searchaccelerated iterative algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Iterative procedures involving nonlinear operators (47J25)

Recommendations

• A modified algorithm for solving the split feasibility problem
• Regularized methods for the split feasibility problem
• An implementable splitting algorithm for the _1-norm regularized split feasibility problem
• Strong convergence of a self-adaptive method for the split feasibility problem in Banach spaces
• Strong convergence of a self-adaptive method for the split feasibility problem

Cites work

• scientific article; zbMATH DE number 936298 (Why is no real title available?)
• 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
• 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
• An implementable splitting algorithm for the _1-norm regularized split feasibility problem
• Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
• Convexly constrained linear inverse problems: Iterative least-squares and regularization
• Deblurring Images
• Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
• Improved relaxed CQ methods for solving the split feasibility problem
• Iterative Solution of Nonlinear Equations in Several Variables
• Iterative oblique projection onto convex sets and the split feasibility problem
• Several solution methods for the split feasibility problem
• The relaxed CQ algorithm solving the split feasibility problem
• The strong convergence of a KM-CQ-like algorithm for a split feasibility problem

Cited in

(4)

• An implementable splitting algorithm for the _1-norm regularized split feasibility problem
• A dynamical system method for solving the split convex feasibility problem
• A new fixed-time stability of neural network to solve split convex feasibility problems
• A fast splitting method for efficient split Bregman iterations

This page was built for publication: Fast self-adaptive regularization iterative algorithm for solving split feasibility problem

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