Pages that link to "Item:Q2392933"

The following pages link to Efficient block-coordinate descent algorithms for the group Lasso (Q2392933):

Displaying 27 items.

• Inexact coordinate descent: complexity and preconditioning (Q306308) (← links)
• Split Bregman algorithms for multiple measurement vector problem (Q336036) (← links)
• Practical inexact proximal quasi-Newton method with global complexity analysis (Q344963) (← links)
• Block coordinate descent algorithms for large-scale sparse multiclass classification (Q399900) (← links)
• Proximal methods for the latent group lasso penalty (Q457209) (← links)
• A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints (Q461437) (← links)
• On the complexity analysis of randomized block-coordinate descent methods (Q494345) (← links)
• Group sparse optimization for learning predictive state representations (Q778374) (← links)
• Enhanced joint sparsity via iterative support detection (Q778436) (← links)
• Hybrid safe-strong rules for efficient optimization in Lasso-type problems (Q830584) (← links)
• A flexible coordinate descent method (Q1639710) (← links)
• Varying coefficient linear discriminant analysis for dynamic data (Q2084480) (← links)
• LASSO for streaming data with adaptative filtering (Q2104007) (← links)
• Block layer decomposition schemes for training deep neural networks (Q2173515) (← links)
• Randomness and permutations in coordinate descent methods (Q2189444) (← links)
• An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems (Q2288192) (← links)
• On the proximal Landweber Newton method for a class of nonsmooth convex problems (Q2340491) (← links)
• Parallel block coordinate minimization with application to group regularized regression (Q2358088) (← links)
• Random block coordinate descent methods for linearly constrained optimization over networks (Q2401516) (← links)
• Empirical risk minimization: probabilistic complexity and stepsize strategy (Q2419551) (← links)
• Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function (Q2452370) (← links)
• Ontology Sparse Vector Learning Algorithm for Ontology Similarity Measuring and Ontology Mapping via ADAL Technology (Q2800674) (← links)
• An alternating direction method for total variation denoising (Q2943837) (← links)
• Separable approximations and decomposition methods for the augmented Lagrangian (Q2943840) (← links)
• An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization (Q3451763) (← links)
• Iterative rank-one matrix completion via singular value decomposition and nuclear norm regularization (Q6089961) (← links)
• Linearly-convergent FISTA variant for composite optimization with duality (Q6101606) (← links)