Pages that link to "Item:Q1927184"
From MaRDI portal
The following pages link to An alternating direction method for finding Dantzig selectors (Q1927184):
Displaying 15 items.
- Comparison of several fast algorithms for projection onto an ellipsoid (Q515784) (← links)
- A fast splitting method tailored for Dantzig selector (Q887167) (← links)
- An alternating direction method of multipliers for MCP-penalized regression with high-dimensional data (Q1633879) (← links)
- Finding Dantzig selectors with a proximity operator based fixed-point algorithm (Q1663200) (← links)
- The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector (Q1686207) (← links)
- Peaceman-Rachford splitting for a class of nonconvex optimization problems (Q1687318) (← links)
- Statistical multiresolution Dantzig estimation in imaging: fundamental concepts and algorithmic framework (Q1950814) (← links)
- A partially proximal linearized alternating minimization method for finding Dantzig selectors (Q1983897) (← links)
- The regularization continuation method with an adaptive time step control for linearly constrained optimization problems (Q2165865) (← links)
- Further properties of the forward-backward envelope with applications to difference-of-convex programming (Q2364125) (← links)
- A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing (Q2405990) (← links)
- An ADMM with continuation algorithm for non-convex SICA-penalized regression in high dimensions (Q4960646) (← links)
- The Dantzig selector: recovery of signal via ℓ <sub>1</sub> − αℓ <sub>2</sub> minimization (Q5014489) (← links)
- Efficient Sparse Hessian-Based Semismooth Newton Algorithms for Dantzig Selector (Q5021412) (← links)
- The regularization continuation method for optimization problems with nonlinear equality constraints (Q6196231) (← links)