Pages that link to "Item:Q2796799"

The following pages link to A Fast Active Set Block Coordinate Descent Algorithm for $\ell_1$-Regularized Least Squares (Q2796799):

Displayed 14 items.

• An active-set algorithmic framework for non-convex optimization problems over the simplex (Q782910) ‎ (← links)
• A flexible coordinate descent method (Q1639710) ‎ (← links)
• A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem (Q1734301) ‎ (← links)
• Second-order orthant-based methods with enriched Hessian information for sparse \(\ell _1\)-optimization (Q2013139) ‎ (← links)
• Minimization over the \(\ell_1\)-ball using an active-set non-monotone projected gradient (Q2082555) ‎ (← links)
• A decomposition method for Lasso problems with zero-sum constraint (Q2106751) ‎ (← links)
• An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization (Q2307750) ‎ (← links)
• ``Active-set complexity'' of proximal gradient: how long does it take to find the sparsity pattern? (Q2311100) ‎ (← links)
• A two-stage active-set algorithm for bound-constrained optimization (Q2359771) ‎ (← links)
• Accelerating block coordinate descent methods with identification strategies (Q2419524) ‎ (← links)
• An active set Newton-CG method for \(\ell_1\) optimization (Q2659721) ‎ (← links)
• Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search (Q5080500) ‎ (← links)
• (Q5149027) ‎ (← links)
• A fast conjugate gradient algorithm with active set prediction for ℓ₁ optimization (Q5238070) ‎ (← links)