On the convergence of block coordinate descent type methods

Recommendations

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
Iteration complexity of a block coordinate gradient descent method for convex optimization
A block coordinate gradient descent method for regularized convex separable optimization and covariance selection
On the iteration complexity of cyclic coordinate gradient descent methods
On the complexity analysis of randomized block-coordinate descent methods

Cited in

(only showing first 100 items - show all)

On the convergence of the coordinate descent method for convex differentiable minimization
A globally convergent algorithm for nonconvex optimization based on block coordinate update
Accelerated alternating descent methods for Dykstra-like problems
Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights
Rate of convergence analysis of dual-based variables decomposition methods for strongly convex problems
A block coordinate variable metric linesearch based proximal gradient method
3D joint hydrogeophysical inversion using similarity measures
Block conjugate gradient type methods for the approximation of bilinear form $C^HA^{-1}B$
Convergent inexact penalty decomposition methods for cardinality-constrained problems
Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization
T-product factorization method for internet traffic data completion with spatio-temporal regularization
A fundamental proof of convergence of alternating direction method of multipliers for weakly convex optimization
An alternating algorithm for finding linear Arrow-Debreu market equilibria
Risk-averse policy optimization via risk-neutral policy optimization
Cyclic coordinate descent in the Hölder smooth setting
Curiosities and counterexamples in smooth convex optimization
On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization
On the convergence of a block-coordinate incremental gradient method
On the rate of convergence of alternating minimization for non-smooth non-strongly convex optimization in Banach spaces
Additive Schwarz methods for convex optimization with backtracking
Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis
An accelerated coordinate gradient descent algorithm for non-separable composite optimization
A variational method for Abel inversion tomography with mixed Poisson-Laplace-Gaussian noise
Block coordinate descent for smooth nonconvex constrained minimization
Inertial alternating direction method of multipliers for non-convex non-smooth optimization
Block layer decomposition schemes for training deep neural networks
Randomness and permutations in coordinate descent methods
Convergence of slice-based block coordinate descent algorithm for convolutional sparse coding
Synchronous parallel block coordinate descent method for nonsmooth convex function minimization
Bregman Itoh-Abe methods for sparse optimisation
Worst-case complexity of cyclic coordinate descent: O(n^2) gap with randomized version
Column-oriented algebraic iterative methods for nonnegative constrained least squares problems
Outlier detection in networks with missing links
Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM
Markov chain block coordinate descent
A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions
On the convergence of inexact block coordinate descent methods for constrained optimization
Parallel block coordinate minimization with application to group regularized regression
Random block coordinate descent methods for linearly constrained optimization over networks
A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications
Accelerating block coordinate descent methods with identification strategies
Empirical risk minimization: probabilistic complexity and stepsize strategy
An almost cyclic 2-coordinate descent method for singly linearly constrained problems
A parallel line search subspace correction method for composite convex optimization
Distributed constraint-coupled optimization via primal decomposition over random time-varying graphs
A spatial Pareto exchange economy problem
An efficient inexact ABCD method for least squares semidefinite programming
Coordinate descent with arbitrary sampling. II: Expected separable overapproximation.
On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
Block stochastic gradient iteration for convex and nonconvex optimization
On Convergence of the Maximum Block Improvement Method
Asynchronous stochastic coordinate descent: parallelism and convergence properties
Stochastic block mirror descent methods for nonsmooth and stochastic optimization
Inexact block coordinate descent methods with application to non-negative matrix factorization
MAGMA: multilevel accelerated gradient mirror descent algorithm for large-scale convex composite minimization
A randomized coordinate descent method with volume sampling
Accelerating nonnegative matrix factorization algorithms using extrapolation
A block successive upper-bound minimization method of multipliers for linearly constrained convex optimization
The cyclic block conditional gradient method for convex optimization problems
An accelerated randomized proximal coordinate gradient method and its application to regularized empirical risk minimization
Decomposition methods for sparse matrix nearness problems
A proximal block minimization method of multipliers with a substitution procedure
Parallel random coordinate descent method for composite minimization: convergence analysis and error bounds
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
On faster convergence of cyclic block coordinate descent-type methods for strongly convex minimization
A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
A block-coordinate descent method for linearly constrained minimization problem
Distributed deterministic asynchronous algorithms in time-varying graphs through Dykstra splitting
The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
A coordinate-descent primal-dual algorithm with large step size and possibly nonseparable functions
On the complexity analysis of randomized block-coordinate descent methods
A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
A class of parallel doubly stochastic algorithms for large-scale learning
Randomized Gradient Boosting Machine
scientific article; zbMATH DE number 7370558 (Why is no real title available?)
Block Bregman majorization minimization with extrapolation
Newton-type multilevel optimization method
scientific article; zbMATH DE number 7626768 (Why is no real title available?)
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
Active-set identification with complexity guarantees of an almost cyclic 2-coordinate descent method with Armijo line search
On the linear convergence of the multimarginal Sinkhorn algorithm
slimTrain---A Stochastic Approximation Method for Training Separable Deep Neural Networks
On the efficiency of random permutation for ADMM and coordinate descent
Analysis of the Block Coordinate Descent Method for Linear Ill-Posed Problems
Fast nonoverlapping block Jacobi method for the dual Rudin-Osher-Fatemi model
Additive Schwarz methods for convex optimization as gradient methods
Analyzing random permutations for cyclic coordinate descent
Convergence analysis of the fast subspace descent method for convex optimization problems
Numerical experiments on stochastic block proximal-gradient type method for convex constrained optimization involving coordinatewise separable problems
Fast best subset selection: coordinate descent and local combinatorial optimization algorithms
The analysis of alternating minimization method for double sparsity constrained optimization problem
scientific article; zbMATH DE number 7409363 (Why is no real title available?)
GAITA: a Gauss-Seidel iterative thresholding algorithm for _q regularized least squares regression
Learning sparse classifiers: continuous and mixed integer optimization perspectives
Alternating structure-adapted proximal gradient descent for nonconvex nonsmooth block-regularized problems
Variational image regularization with Euler's elastica using a discrete gradient scheme
An alternating minimization method for robust principal component analysis

This page was built for publication: On the convergence of block coordinate descent type methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408210)