On the convergence of a block-coordinate incremental gradient method
From MaRDI portal
Recommendations
- On the convergence of block coordinate descent type methods
- On the convergence of inexact block coordinate descent methods for constrained optimization
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Iteration complexity of a block coordinate gradient descent method for convex optimization
- On convergence of block iterative methods
- Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
- Block stochastic gradient iteration for convex and nonconvex optimization
- On the convergence of a randomized block coordinate descent algorithm for a matrix least squares problem
- On the Convergence Rate of Incremental Aggregated Gradient Algorithms
Cites work
- A Convergent Incremental Gradient Method with a Constant Step Size
- A Stochastic Approximation Method
- An incremental decomposition method for unconstrained optimization
- Block layer decomposition schemes for training deep neural networks
- Convergent decomposition techniques for training RBF neural networks
- Coordinate descent algorithms
- Deep learning
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Globally convergent block-coordinate techniques for unconstrained optimization
- Gradient Convergence in Gradient methods with Errors
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- Incremental gradient algorithms with stepsizes bounded away from zero
- Incremental Least Squares Methods and the Extended Kalman Filter
- Large-scale machine learning with stochastic gradient descent
- Logistic regression, AdaBoost and Bregman distances
- On the complexity analysis of randomized block-coordinate descent methods
- On the convergence of block coordinate descent type methods
- Optimization methods for large-scale machine learning
Cited in
(8)- On Convergence of the Maximum Block Improvement Method
- Acceleration of block coordinate descent method achieves the $\bm{O(\frac{1}{k^2})}$ rate of convergence for a convex function with block coordinate strong convexity
- scientific article; zbMATH DE number 7409363 (Why is no real title available?)
- On the Convergence Rate of Incremental Aggregated Gradient Algorithms
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Convergence of Gradient-Based Block Coordinate Descent Algorithms for Nonorthogonal Joint Approximate Diagonalization of Matrices
- Convergence of ease-controlled random reshuffling gradient algorithms under Lipschitz smoothness
- Block coordinate descent methods of centres for solving block-constrained optimization problems
This page was built for publication: On the convergence of a block-coordinate incremental gradient method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2100401)
