Pages that link to "Item:Q5348467"
From MaRDI portal
The following pages link to A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions (Q5348467):
Displaying 11 items.
- A subspace-accelerated split Bregman method for sparse data recovery with joint \(\ell_1\)-type regularizers (Q2208931) (← links)
- An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization (Q2307750) (← links)
- Accelerating block coordinate descent methods with identification strategies (Q2419524) (← links)
- An active set Newton-CG method for \(\ell_1\) optimization (Q2659721) (← links)
- FaRSA for ℓ<sub>1</sub>-regularized convex optimization: local convergence and numerical experience (Q4638928) (← links)
- A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer (Q5072590) (← links)
- A fast conjugate gradient algorithm with active set prediction for ℓ<sub>1</sub> optimization (Q5238070) (← links)
- A Dimension Reduction Technique for Large-Scale Structured Sparse Optimization Problems with Application to Convex Clustering (Q5869815) (← links)
- An inexact quasi-Newton algorithm for large-scale \(\ell_1\) optimization with box constraints (Q6064946) (← links)
- On the stationarity for nonlinear optimization problems with polyhedral constraints (Q6126646) (← links)
- An l-BFGS algorithm for solving large-scale \(\ell_1\) problems (Q6665206) (← links)
