Splitting methods for split feasibility problems with application to Dantzig selectors
From MaRDI portal
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
(24)- On the splitting problem for selections
- The combination projection method for solving convex feasibility problems
- \(l_1\)-\(l_2\) regularization of split feasibility 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
- Regularization for the split feasibility problem
- An implementable splitting algorithm for the _1-norm regularized split feasibility problem
- Regularized methods for the split feasibility problem
- Efficient sparse Hessian-based semismooth Newton algorithms for Dantzig selector
- Ball-relaxed projection algorithms for multiple-sets split feasibility problem
- 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 proximal alternating direction method of multipliers for DC programming with structured constraints
- Modified general splitting method for the split feasibility problem
- The split feasibility problem with multiple output sets in uniformly convex Banach spaces
- Inertial hybrid projection method for solving split common fixed point problem
- A dynamical system with fixed-time convergence for solving the split feasibility problem and applications to signal recovery
- Two-step inertial accelerated algorithms for solving split feasibility problem with multiple output sets
- An adaptive and expanded framework for multiple-operator split common fixed point problems
- Feature splitting parallel algorithm for Dantzig selectors
- Stability analysis of split equality and split feasibility problems
- Robust penalized Dantzig selector: error analysis, oracle inequalities, and algorithmic efficiency
- Max-residual selection operators for families of cutters with applications to split feasibility problems
- A fast splitting method tailored for Dantzig selector
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)
