Pages that link to "Item:Q494345"
From MaRDI portal
The following pages link to On the complexity analysis of randomized block-coordinate descent methods (Q494345):
Displaying 40 items.
- On optimal probabilities in stochastic coordinate descent methods (Q315487) (← links)
- Decomposable norm minimization with proximal-gradient homotopy algorithm (Q513723) (← links)
- Iteration complexity analysis of block coordinate descent methods (Q526831) (← links)
- A flexible coordinate descent method (Q1639710) (← links)
- A globally convergent algorithm for nonconvex optimization based on block coordinate update (Q1676921) (← links)
- Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights (Q1717220) (← links)
- Stochastic block-coordinate gradient projection algorithms for submodular maximization (Q1723100) (← links)
- Pathwise coordinate optimization for sparse learning: algorithm and theory (Q1747736) (← links)
- Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization (Q1753069) (← links)
- Inexact variable metric stochastic block-coordinate descent for regularized optimization (Q1985280) (← links)
- Generalized stochastic Frank-Wolfe algorithm with stochastic ``substitute'' gradient for structured convex optimization (Q2020608) (← links)
- Fast and safe: accelerated gradient methods with optimality certificates and underestimate sequences (Q2044479) (← links)
- On the convergence of a randomized block coordinate descent algorithm for a matrix least squares problem (Q2060942) (← links)
- Gauss-Seidel method with oblique direction (Q2063282) (← links)
- On the convergence of a block-coordinate incremental gradient method (Q2100401) (← links)
- A two-step randomized Gauss-Seidel method for solving large-scale linear least squares problems (Q2127524) (← links)
- Greedy randomized and maximal weighted residual Kaczmarz methods with oblique projection (Q2127557) (← links)
- Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis (Q2133415) (← links)
- On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems (Q2192631) (← links)
- Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version (Q2220668) (← links)
- Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup (Q2235160) (← links)
- Randomized primal-dual proximal block coordinate updates (Q2314059) (← links)
- A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications (Q2414911) (← links)
- A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression (Q2419533) (← links)
- On the convergence of asynchronous parallel iteration with unbounded delays (Q2422607) (← links)
- Misspecified nonconvex statistical optimization for sparse phase retrieval (Q2425184) (← links)
- A parallel line search subspace correction method for composite convex optimization (Q2516372) (← links)
- On multi-step greedy randomized coordinate descent method for solving large linear least-squares problems (Q2686517) (← links)
- Optimization in High Dimensions via Accelerated, Parallel, and Proximal Coordinate Descent (Q2832112) (← links)
- Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization (Q2945126) (← links)
- Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties (Q2954387) (← links)
- A Fast Block Coordinate Descent Method for Solving Linear Least-Squares Problems (Q5061750) (← links)
- Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems (Q5870350) (← links)
- Adaptive coordinate sampling for stochastic primal–dual optimization (Q6092496) (← links)
- Block Policy Mirror Descent (Q6093281) (← links)
- Stochastic mirror descent method for linear ill-posed problems in Banach spaces (Q6101039) (← links)
- On greedy randomized block Gauss-Seidel method with averaging for sparse linear least-squares problems (Q6142558) (← links)
- Efficient Global Optimization of Two-Layer ReLU Networks: Quadratic-Time Algorithms and Adversarial Training (Q6171686) (← links)
- Random Coordinate Descent Methods for Nonseparable Composite Optimization (Q6176428) (← links)
- Adaptive proximal SGD based on new estimating sequences for sparser ERM (Q6196471) (← links)
