On the Convergence of Block Coordinate Descent Type Methods
From MaRDI portal
Publication:5408210
DOI10.1137/120887679zbMATH Open1297.90113OpenAlexW2023901033MaRDI QIDQ5408210FDOQ5408210
Publication date: 9 April 2014
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/14a382407b34a8b5704dd51347c9308dfb24e6f3
Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06)
Cited In (only showing first 100 items - show all)
- Coordinate descent with arbitrary sampling II: expected separable overapproximation
- A mean field game model for the evolution of cities
- An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems
- Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications
- Cyclic coordinate descent in the Hölder smooth setting
- A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization
- Fast Nonoverlapping Block Jacobi Method for the Dual Rudin--Osher--Fatemi Model
- Schwarz iterative methods: infinite space splittings
- The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
- A parallel line search subspace correction method for composite convex optimization
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
- A generic coordinate descent solver for non-smooth convex optimisation
- On asymptotic convergence of the block-iterative Fisher scoring algorithm
- Outlier detection in networks with missing links
- Variational Image Regularization with Euler's Elastica Using a Discrete Gradient Scheme
- Accelerating block coordinate descent methods with identification strategies
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
- MAGMA: Multilevel Accelerated Gradient Mirror Descent Algorithm for Large-Scale Convex Composite Minimization
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
- Iteration Complexity of a Block Coordinate Gradient Descent Method for Convex Optimization
- Distributed constraint-coupled optimization via primal decomposition over random time-varying graphs
- Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights
- On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
- 3D joint hydrogeophysical inversion using similarity measures
- An alternating minimization method for robust principal component analysis
- Block conjugate gradient type methods for the approximation of bilinear form \(C^HA^{-1}B\)
- On Convergence of the Maximum Block Improvement Method
- Accelerating Nonnegative Matrix Factorization Algorithms Using Extrapolation
- On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization
- Zeroth-order optimization with orthogonal random directions
- Decomposition Methods for Sparse Matrix Nearness Problems
- An efficient inexact ABCD method for least squares semidefinite programming
- Convergent inexact penalty decomposition methods for cardinality-constrained problems
- A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
- Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis
- On the complexity analysis of randomized block-coordinate descent methods
- Parallel block coordinate minimization with application to group regularized regression
- Rate of convergence analysis of dual-based variables decomposition methods for strongly convex problems
- A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization
- Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties
- Subspace correction methods in algebraic multi-level frames
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- The Cyclic Block Conditional Gradient Method for Convex Optimization Problems
- Analyzing random permutations for cyclic coordinate descent
- An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization
- Convergence analysis of the Fast Subspace Descent method for convex optimization problems
- Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization
- T-product factorization method for internet traffic data completion with spatio-temporal regularization
- Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM
- Risk-averse optimization of reward-based coherent risk measures
- Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms
- On Faster Convergence of Cyclic Block Coordinate Descent-type Methods for Strongly Convex Minimization
- Randomized Block Proximal Damped Newton Method for Composite Self-Concordant Minimization
- Stochastic Block Mirror Descent Methods for Nonsmooth and Stochastic Optimization
- A fundamental proof of convergence of alternating direction method of multipliers for weakly convex optimization
- Iteration complexity analysis of block coordinate descent methods
- Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems
- Parallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error Bounds
- Large-Scale Nonconvex Optimization: Randomization, Gap Estimation, and Numerical Resolution
- A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Analysis of the Block Coordinate Descent Method for Linear Ill-Posed Problems
- On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization
- Random Coordinate Descent Methods for Nonseparable Composite Optimization
- Randomized Gradient Boosting Machine
- An introduction to continuous optimization for imaging
- A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications
- Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning
- On the Efficiency of Random Permutation for ADMM and Coordinate Descent
- Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version
- Regularization of inverse problems via time discrete geodesics in image spaces
- Random block coordinate descent methods for linearly constrained optimization over networks
- GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression
- An almost cyclic 2-coordinate descent method for singly linearly constrained problems
- Accelerated alternating descent methods for Dykstra-like problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions
- An Optimized Dynamic Mode Decomposition Model Robust to Multiplicative Noise
- On the convergence of a block-coordinate incremental gradient method
- Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
- Riemannian preconditioned coordinate descent for low multilinear rank approximation
- slimTrain---A Stochastic Approximation Method for Training Separable Deep Neural Networks
- Block layer decomposition schemes for training deep neural networks
- Optimal modeling of nonlinear systems: method of variable injections
- Online convex optimization using coordinate descent algorithms
- A distributed computing method integrating improved gradient projection for solving stochastic traffic equilibrium problem
- Column-oriented algebraic iterative methods for nonnegative constrained least squares problems
- Randomized methods for computing optimal transport without regularization and their convergence analysis
- 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
- A Randomized Coordinate Descent Method with Volume Sampling
- On the Linear Convergence of the Multimarginal Sinkhorn Algorithm
- An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints
- Signal Decomposition Using Masked Proximal Operators
- Identification of partial-differential-equations-based models from noisy data with splines
- Grouped variable selection with discrete optimization: computational and statistical perspectives
- Global stability of first-order methods for coercive tame functions
- A survey of numerical algorithms that can solve the Lasso problems
- Bregman methods for large-scale optimization with applications in imaging
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)