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 50 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)
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function (Q2452370) (← 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)
- Accelerated, Parallel, and Proximal Coordinate Descent (Q3449571) (← links)
- An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization (Q3451763) (← links)
- Distributed Block Coordinate Descent for Minimizing Partially Separable Functions (Q3462314) (← links)
- Parallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error Bounds (Q3465244) (← links)
- On Faster Convergence of Cyclic Block Coordinate Descent-type Methods for Strongly Convex Minimization (Q4558510) (← links)
- (Q4558559) (← links)
- Iterative positive thresholding algorithm for non-negative sparse optimization (Q4559400) (← 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)
- On the Complexity Analysis of the Primal Solutions for the Accelerated Randomized Dual Coordinate Ascent (Q4969070) (← links)
- (Q4969198) (← links)
- On Adaptive Sketch-and-Project for Solving Linear Systems (Q4997841) (← links)
- An efficient nonmonotone projected Barzilai–Borwein method for nonnegative matrix factorization with extrapolation (Q5031230) (← links)
- A Fast Block Coordinate Descent Method for Solving Linear Least-Squares Problems (Q5061750) (← links)
- (Q5148937) (← links)
- Two Symmetrized Coordinate Descent Methods Can Be $O(n^2)$ Times Slower Than the Randomized Version (Q5162659) (← links)
- Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone (Q5242932) (← links)
- Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications (Q5348257) (← links)
