Pages that link to "Item:Q2288192"

The following pages link to An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems (Q2288192):

Displaying 12 items.

• A dual based semismooth Newton-type algorithm for solving large-scale sparse Tikhonov regularization problems (Q2033078) (← links)
• An efficient Hessian based algorithm for singly linearly and box constrained least squares regression (Q2049105) (← links)
• A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems (Q2095559) (← links)
• An investigation on semismooth Newton based augmented Lagrangian method for image restoration (Q2162237) (← links)
• An efficient augmented Lagrangian method with semismooth Newton solver for total generalized variation (Q2697370) (← links)
• A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems (Q6051310) (← links)
• Group linear algorithm with sparse principal decomposition: a variable selection and clustering method for generalized linear models (Q6099122) (← links)
• Linearly-convergent FISTA variant for composite optimization with duality (Q6101606) (← links)
• A dual semismooth Newton based augmented Lagrangian method for large-scale linearly constrained sparse group square-root Lasso problems (Q6111345) (← links)
• Newton-type methods with the proximal gradient step for sparse estimation (Q6130698) (← links)
• A semismooth Newton stochastic proximal point algorithm with variance reduction (Q6490309) (← links)
• A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-Quadratic Regularized Optimal Transport Problems (Q6500198) (← links)