Splitting methods for split feasibility problems with application to Dantzig selectors

DOI10.1088/1361-6420/AA5EC5MaRDI QIDQ5268470zbMATHOpenAlexFDO

Authors 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

inverse problemstatistical learningalgorithmnumerical examplesplit feasibility problemsignal/image processingDantzig selectors

Mathematics Subject Classification ID

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

Recommendations

• Regularized methods for the split feasibility problem
• \(l_1\)-\(l_2\) regularization of split feasibility problems
• Regularization for the split feasibility problem
• An implementable splitting algorithm for the _1-norm regularized split feasibility problem
• A fast splitting method tailored for Dantzig selector

Cited in

(19)

• 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
• An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem
• A dynamical system with fixed-time convergence for solving the split feasibility problem and applications to signal recovery
• A fast splitting method tailored for Dantzig selector
• A strong convergence theorem for an iterative method for solving the split variational inequalities in Hilbert spaces
• On the splitting problem for selections
• A proximal alternating direction method of multipliers for DC programming with structured constraints
• A partially proximal linearized alternating minimization method for finding Dantzig selectors
• Regularization for the split feasibility problem
• \(l_1\)-\(l_2\) regularization of split feasibility problems
• Efficient sparse Hessian-based semismooth Newton algorithms for Dantzig selector
• Ball-relaxed projection algorithms for multiple-sets split feasibility problem
• Modified general splitting method for the split feasibility problem
• Inertial hybrid projection method for solving split common fixed point problem
• The split feasibility problem with multiple output sets in uniformly convex Banach spaces
• The combination projection method for solving convex feasibility problems
• Two-step inertial accelerated algorithms for solving split feasibility problem with multiple output sets
• Regularized methods for the split feasibility problem

Describes a project that uses

Uses Software

• BMSS

This page was built for publication: Splitting methods for split feasibility problems with application to Dantzig selectors

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