Pages that link to "Item:Q2902875"

The following pages link to Accelerated Block-coordinate Relaxation for Regularized Optimization (Q2902875):

Displaying 29 items.

• A second-order method for strongly convex \(\ell _1\)-regularization problems (Q263191) (← links)
• Inexact coordinate descent: complexity and preconditioning (Q306308) (← links)
• Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization (Q344922) (← links)
• Block coordinate descent algorithms for large-scale sparse multiclass classification (Q399900) (← links)
• On the complexity analysis of randomized block-coordinate descent methods (Q494345) (← links)
• Sample size selection in optimization methods for machine learning (Q715253) (← links)
• Regularized optimization with spatial coupling for robust decision making (Q723991) (← links)
• A flexible coordinate descent method (Q1639710) (← links)
• Stochastic block-coordinate gradient projection algorithms for submodular maximization (Q1723100) (← links)
• Convergence of the augmented decomposition algorithm (Q1734773) (← links)
• Inexact variable metric stochastic block-coordinate descent for regularized optimization (Q1985280) (← links)
• Second-order orthant-based methods with enriched Hessian information for sparse \(\ell _1\)-optimization (Q2013139) (← links)
• Feature selection in SVM via polyhedral \(k\)-norm (Q2300635) (← links)
• ``Active-set complexity'' of proximal gradient: how long does it take to find the sparsity pattern? (Q2311100) (← links)
• An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization (Q2352420) (← links)
• Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems (Q2374363) (← links)
• Random block coordinate descent methods for linearly constrained optimization over networks (Q2401516) (← links)
• A Fast Active Set Block Coordinate Descent Algorithm for $\ell_1$-Regularized Least Squares (Q2796799) (← links)
• An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization (Q3451763) (← links)
• A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming (Q4596724) (← links)
• On the complexity of parallel coordinate descent (Q4638927) (← links)
• Proximal Gradient Methods with Adaptive Subspace Sampling (Q5026438) (← links)
• A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer (Q5072590) (← links)
• Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search (Q5080500) (← links)
• First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants (Q5233104) (← links)
• Randomized Block Proximal Damped Newton Method for Composite Self-Concordant Minimization (Q5355205) (← links)
• On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization (Q6158001) (← links)
• Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification (Q6165598) (← links)
• Local linear convergence of proximal coordinate descent algorithm (Q6181368) (← links)