Pages that link to "Item:Q2038299"
From MaRDI portal
The following pages link to A unified primal dual active set algorithm for nonconvex sparse recovery (Q2038299):
Displayed 12 items.
- Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem (Q2072164) (← links)
- High-performance statistical computing in the computing environments of the 2020s (Q2092893) (← links)
- High-dimensional linear regression with hard thresholding regularization: theory and algorithm (Q2097492) (← links)
- GSDAR: a fast Newton algorithm for \(\ell_0\) regularized generalized linear models with statistical guarantee (Q2135875) (← links)
- A truncated Newton algorithm for nonconvex sparse recovery (Q2143093) (← links)
- A data-driven line search rule for support recovery in high-dimensional data analysis (Q2157522) (← links)
- Sparse signal recovery from phaseless measurements via hard thresholding pursuit (Q2667051) (← links)
- A primal and dual active set algorithm for truncated \(L_1\) regularized logistic regression (Q2691265) (← links)
- Hard Thresholding Regularised Logistic Regression: Theory and Algorithms (Q5061727) (← links)
- A primal dual active set with continuation algorithm for high-dimensional nonconvex SICA-penalized regression (Q5107360) (← links)
- A communication-efficient method for ℓ<sub>0</sub> regularization linear regression models (Q6074135) (← links)
- A global two-stage algorithm for non-convex penalized high-dimensional linear regression problems (Q6177008) (← links)
