Pages that link to "Item:Q263212"
From MaRDI portal
The following pages link to Parallel coordinate descent methods for big data optimization (Q263212):
Displaying 50 items.
- A second-order method for strongly convex \(\ell _1\)-regularization problems (Q263191) (← links)
- Selective bi-coordinate variations for resource allocation type problems (Q301690) (← links)
- Inexact coordinate descent: complexity and preconditioning (Q306308) (← links)
- On optimal probabilities in stochastic coordinate descent methods (Q315487) (← links)
- Block coordinate descent algorithms for large-scale sparse multiclass classification (Q399900) (← links)
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints (Q461437) (← links)
- Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization (Q486721) (← links)
- On the complexity analysis of randomized block-coordinate descent methods (Q494345) (← links)
- Reduced-rank multi-label classification (Q517398) (← links)
- An extragradient-based alternating direction method for convex minimization (Q525598) (← links)
- An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems (Q825333) (← links)
- A flexible coordinate descent method (Q1639710) (← links)
- Data learning from big data (Q1642365) (← links)
- Parallel distributed block coordinate descent methods based on pairwise comparison oracle (Q1675626) (← links)
- Functional-bandwidth kernel for support vector machine with functional data: an alternating optimization algorithm (Q1711465) (← links)
- Cost-sensitive feature selection for support vector machines (Q1734839) (← links)
- Matrix completion under interval uncertainty (Q1752160) (← links)
- Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization (Q1753069) (← links)
- Block coordinate descent energy minimization for dynamic cohesive fracture (Q1988165) (← links)
- A geometric probability randomized Kaczmarz method for large scale linear systems (Q1995943) (← links)
- An online-learning-based evolutionary many-objective algorithm (Q1999048) (← links)
- Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods (Q2023684) (← links)
- Stochastic quasi-gradient methods: variance reduction via Jacobian sketching (Q2039235) (← links)
- Fastest rates for stochastic mirror descent methods (Q2044496) (← links)
- Parallel subgradient algorithm with block dual decomposition for large-scale optimization (Q2077960) (← links)
- High-performance statistical computing in the computing environments of the 2020s (Q2092893) (← links)
- Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis (Q2133415) (← links)
- An efficient parallel block coordinate descent algorithm for large-scale precision matrix estimation using graphics processing units (Q2135867) (← links)
- Randomness and permutations in coordinate descent methods (Q2189444) (← links)
- Testing and non-linear preconditioning of the proximal point method (Q2198162) (← links)
- Synchronous parallel block coordinate descent method for nonsmooth convex function minimization (Q2200102) (← links)
- Primal-dual block-proximal splitting for a class of non-convex problems (Q2218923) (← links)
- Markov chain block coordinate descent (Q2301127) (← links)
- Restarting the accelerated coordinate descent method with a rough strong convexity estimate (Q2301128) (← links)
- Randomized primal-dual proximal block coordinate updates (Q2314059) (← links)
- Block-proximal methods with spatially adapted acceleration (Q2323015) (← links)
- Coordinate descent algorithms (Q2349114) (← links)
- Parallel block coordinate minimization with application to group regularized regression (Q2358088) (← 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)
- Accelerating block coordinate descent methods with identification strategies (Q2419524) (← links)
- A framework for parallel second order incremental optimization algorithms for solving partially separable problems (Q2419531) (← links)
- A parallel line search subspace correction method for composite convex optimization (Q2516372) (← links)
- On the convergence analysis of asynchronous SGD for solving consistent linear systems (Q2685380) (← links)
- A Fast Active Set Block Coordinate Descent Algorithm for $\ell_1$-Regularized Least Squares (Q2796799) (← links)
- ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates (Q2821779) (← links)
- Coordinate descent with arbitrary sampling I: algorithms and complexity<sup>†</sup> (Q2829565) (← links)
- Coordinate descent with arbitrary sampling II: expected separable overapproximation (Q2829566) (← links)
- Optimization in High Dimensions via Accelerated, Parallel, and Proximal Coordinate Descent (Q2832112) (← links)
- Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties (Q2954387) (← links)
