A modified algorithm for solving the split feasibility problem

MaRDI QIDQ3551244zbMATH OpenFDO

Authors Yan Gao, Weiwei Wang

Publication date 15 April 2010

Full work available at URL http://www.m-hikari.com/imf-password2009/25-28-2009/index.html

zbMATH Keywords

subdifferentialArmijo-like line search

Mathematics Subject Classification ID

Convex programming (90C25) General theory of numerical analysis in abstract spaces (65J05) Convex functions and convex programs in convex geometry (52A41)

Recommendations

• A new algorithm for the split feasibility problem
• A note on the CQ algorithm for the split feasibility problem
• The split feasibility problem and its solution algorithm
• scientific article; zbMATH DE number 7267225
• Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem

Cited in

(12)

• Hybrid CQ projection algorithm with line-search process for the split feasibility problem
• A note on the CQ algorithm for the split feasibility problem
• scientific article; zbMATH DE number 7598016 (Why is no real title available?)
• The split feasibility problem and its solution algorithm
• A new algorithm for the split feasibility problem
• Fast self-adaptive regularization iterative algorithm for solving split feasibility problem
• New generalized variable stepsizes of the CQ algorithm for solving the split feasibility problem
• Split feasibility and fixed point problems
• Solving the market split problem via branch-and-cut
• S-subgradient projection algorithms with Armijo line search for nonconvex split feasibility problems
• Iterative algorithms with Armijo-like search for solving split equality problems
• An MM Algorithm for Split Feasibility Problems

This page was built for publication: A modified algorithm for solving the split feasibility problem

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