Pages that link to "Item:Q2219645"

The following pages link to An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints (Q2219645):

Displaying 12 items.

• An active-set algorithmic framework for non-convex optimization problems over the simplex (Q782910) (← links)
• An active-set projected trust region algorithm for box constrained optimization problems (Q905153) (← links)
• A truncated Newton algorithm for nonconvex sparse recovery (Q2143093) (← links)
• ``Active-set complexity'' of proximal gradient: how long does it take to find the sparsity pattern? (Q2311100) (← links)
• An active set Newton-CG method for \(\ell_1\) optimization (Q2659721) (← links)
• An active-set projected trust-region algorithm with limited memory BFGS technique for box-constrained nonsmooth equations (Q2868903) (← links)
• An algorithm for quadratic ℓ₁-regularized optimization with a flexible active-set strategy (Q3458840) (← links)
• An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints (Q4389186) (← links)
• A dual active-set proximal Newton algorithm for sparse approximation of correlation matrices (Q5058396) (← links)
• An active-set proximal quasi-Newton algorithm for ℓ₁-regularized minimization over a sphere constraint (Q5870141) (← links)
• An inexact quasi-Newton algorithm for large-scale \(\ell_1\) optimization with box constraints (Q6064946) (← links)
• Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy (Q6176299) (← links)