An unconstrained optimization approach to the split feasibility problem

MaRDI QIDQ4644023zbMATH OpenFDO

Authors Hong-Kun Xu, M. A. Alghamdi, Nazeer Shahzad

Publication date 30 May 2018

Full work available at URL http://www.yokohamapublishers.jp/online2/opjnca/vol18/1891.html

zbMATH Keywords

CQ algorithmprojectionsplit feasibility problemunconstrained optimization

Mathematics Subject Classification ID

Variational and other types of inequalities involving nonlinear operators (general) (47J20) Iterative procedures involving nonlinear operators (47J25) Convex programming (90C25)

Recommendations

• A new \(CQ\) method for solving split feasibility problem
• A splitting-relaxed projection method for solving the split feasibility problem
• On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
• The split feasibility problem and its solution algorithm
• Projection algorithm for split feasibility problem

Cited in

(7)

• An MM Algorithm for Split Feasibility Problems
• Two-step methods and relaxed two-step methods for solving the split equality problem
• Robust solutions of split feasibility problem with uncertain linear operator
• Solving the market split problem via branch-and-cut
• Optimization for Inconsistent Split Feasibility Problems
• Gradient methods with selection technique for the multiple-sets split feasibility problem
• scientific article; zbMATH DE number 6285844 (Why is no real title available?)

This page was built for publication: An unconstrained optimization approach to the split feasibility problem

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