Splitting methods for split feasibility problems with application to Dantzig selectors

DOI10.1088/1361-6420/aa5ec5zbMath1367.65088OpenAlexW2594091370MaRDI QIDQ5268470

Hongjin He, Hong-Kun Xu

Publication date: 20 June 2017

Published in: Inverse Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/1361-6420/aa5ec5

zbMATH Keywords

algorithmnumerical exampleinverse problemstatistical learningsplit feasibility problemsignal/image processingDantzig selectors

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Related Items

Ball-relaxed projection algorithms for multiple-sets split feasibility problem, The combination projection method for solving convex feasibility problems, Inertial accelerated algorithms for solving split feasibility with multiple output sets in Hilbert spaces, A partially inertial customized Douglas-Rachford splitting method for a class of structured optimization problems, A partially proximal linearized alternating minimization method for finding Dantzig selectors, A strong convergence theorem for an iterative method for solving the split variational inequalities in Hilbert spaces, Efficient Sparse Hessian-Based Semismooth Newton Algorithms for Dantzig Selector

Uses Software

• BMSS