Pages that link to "Item:Q3458840"

The following pages link to An algorithm for quadratic ℓ₁-regularized optimization with a flexible active-set strategy (Q3458840):

Displaying 22 items.

• An inexact successive quadratic approximation method for L-1 regularized optimization (Q301652) (← links)
• A family of second-order methods for convex \(\ell _1\)-regularized optimization (Q312690) (← 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)
• A decomposition method for Lasso problems with zero-sum constraint (Q2106751) (← links)
• A subspace-accelerated split Bregman method for sparse data recovery with joint \(\ell_1\)-type regularizers (Q2208931) (← links)
• An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints (Q2219645) (← links)
• ``Active-set complexity'' of proximal gradient: how long does it take to find the sparsity pattern? (Q2311100) (← links)
• A preconditioned conjugate gradient method with active set strategy for \(\ell_1\)-regularized least squares (Q2422134) (← links)
• An active set Newton-CG method for \(\ell_1\) optimization (Q2659721) (← links)
• A fast active set block coordinate descent algorithm for \(\ell_1\)-regularized least squares (Q2796799) (← links)
• A second-order method for convex₁-regularized optimization with active-set prediction (Q2815550) (← links)
• Projection onto a polyhedron that exploits sparsity (Q2817841) (← links)
• On the convergence of an active-set method for ℓ₁minimization (Q2905351) (← links)
• (Q5148971) (← links)
• Generalized Conjugate Gradient Methods for <i>ℓ</i>₁ Regularized Convex Quadratic Programming with Finite Convergence (Q5219295) (← links)
• (Q5282668) (← links)
• Randomized Block Proximal Damped Newton Method for Composite Self-Concordant Minimization (Q5355205) (← links)
• An active-set proximal quasi-Newton algorithm for ℓ₁-regularized minimization over a sphere constraint (Q5870141) (← links)
• A dual active set method for \(\ell1\)-regularized problem (Q6102865) (← links)
• Techniques for accelerating branch-and-bound algorithms dedicated to sparse optimization (Q6585819) (← links)
• Barzilai–Borwein-like rules in proximal gradient schemes for ℓ ₁ -regularized problems (Q6640996) (← links)