A gradient algorithm for finding minimum-norm solution of the split feasibility problem

zbMATH Open1384.90094MaRDI QIDQ3134092FDOQ3134092

Authors: Binghua Liu, Biao Qu 

Publication date: 8 February 2018

Full work available at URL: http://www.yokohamapublishers.jp/online2/oppjo/vol13/p355.html

Recommendations

• Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem
• Regularized gradient-projection methods for finding the minimum-norm solution of equilibrium and the constrained convex minimization problem
• Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
• An extragradient method for finding minimum-norm solution of the split equilibrium problem
• The split feasibility problem and its solution algorithm

zbMATH Keywords

gradient algorithmsplit feasibility problemminimum-norm solution

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonlinear programming (90C30)

Cited In (3)

• Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
• An extragradient method for finding minimum-norm solution of the split equilibrium problem
• An MM Algorithm for Split Feasibility Problems

This page was built for publication: A gradient algorithm for finding minimum-norm solution of the split feasibility problem

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