On the Convergence of Block Coordinate Descent Type Methods
From MaRDI portal
Publication:5408210
DOI10.1137/120887679zbMath1297.90113OpenAlexW2023901033MaRDI QIDQ5408210
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)
Related Items
Parallel block coordinate minimization with application to group regularized regression, Additive Schwarz methods for convex optimization with backtracking, Block Bregman Majorization Minimization with Extrapolation, A mean field game model for the evolution of cities, An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems, Newton-type multilevel optimization method, On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems, Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems, Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis, The Cyclic Block Conditional Gradient Method for Convex Optimization Problems, An accelerated coordinate gradient descent algorithm for non-separable composite optimization, An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization, Decomposition Methods for Sparse Matrix Nearness Problems, MAGMA: Multilevel Accelerated Gradient Mirror Descent Algorithm for Large-Scale Convex Composite Minimization, A proximal block minimization method of multipliers with a substitution procedure, Parallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error Bounds, A variational method for Abel inversion tomography with mixed Poisson-Laplace-Gaussian noise, Inertial alternating direction method of multipliers for non-convex non-smooth optimization, Unnamed Item, 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, Random block coordinate descent methods for linearly constrained optimization over networks, Block layer decomposition schemes for training deep neural networks, Distributed constraint-coupled optimization via primal decomposition over random time-varying graphs, A globally convergent algorithm for nonconvex optimization based on block coordinate update, Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization, slimTrain---A Stochastic Approximation Method for Training Separable Deep Neural Networks, A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications, Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and 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, Proximal alternating linearized minimization for nonconvex and nonsmooth problems, Randomness and permutations in coordinate descent methods, Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties, Stochastic Block Mirror Descent Methods for Nonsmooth and Stochastic Optimization, Subspace correction methods in algebraic multi-level frames, Randomized Block Proximal Damped Newton Method for Composite Self-Concordant Minimization, On the Efficiency of Random Permutation for ADMM and Coordinate Descent, Convergence of slice-based block coordinate descent algorithm for convolutional sparse coding, Unnamed Item, 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, Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning, Analyzing random permutations for cyclic coordinate descent, Convergence analysis of the Fast Subspace Descent method for convex optimization problems, Synchronous parallel block coordinate descent method for nonsmooth convex function minimization, Bregman Itoh-Abe methods for sparse optimisation, A spatial Pareto exchange economy problem, 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, A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints, The 2-coordinate descent method for solving double-sided simplex constrained minimization problems, Regularization of inverse problems via time discrete geodesics in image spaces, Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version, Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting, Column-oriented algebraic iterative methods for nonnegative constrained least squares problems, A Randomized Coordinate Descent Method with Volume Sampling, On the complexity analysis of randomized block-coordinate descent methods, The Analysis of Alternating Minimization Method for Double Sparsity Constrained Optimization Problem, Outlier detection in networks with missing links, A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions, Unnamed Item, GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression, On Faster Convergence of Cyclic Block Coordinate Descent-type Methods for Strongly Convex Minimization, Iteration complexity analysis of block coordinate descent methods, Schwarz iterative methods: infinite space splittings, 3D joint hydrogeophysical inversion using similarity measures, Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM, Rate of convergence analysis of dual-based variables decomposition methods for strongly convex problems, Convergent inexact penalty decomposition methods for cardinality-constrained problems, A parallel line search subspace correction method for composite convex optimization, An Efficient Inexact ABCD Method for Least Squares Semidefinite Programming, 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, Accelerating Nonnegative Matrix Factorization Algorithms Using Extrapolation, A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions, Markov chain block coordinate descent, Randomized Gradient Boosting Machine, A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization, T-product factorization method for internet traffic data completion with spatio-temporal regularization, A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems, Coordinate descent with arbitrary sampling II: expected separable overapproximation, Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems, A fundamental proof of convergence of alternating direction method of multipliers for weakly convex optimization, Variational Image Regularization with Euler's Elastica Using a Discrete Gradient Scheme, An alternating minimization method for robust principal component analysis, An alternating algorithm for finding linear Arrow-Debreu market equilibria, Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions, Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms, Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone, 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, Unnamed Item, Unnamed Item, 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, An Optimized Dynamic Mode Decomposition Model Robust to Multiplicative Noise, Block coordinate type methods for optimization and learning, Zeroth-order optimization with orthogonal random directions, Grouped variable selection with discrete optimization: computational and statistical perspectives, Cyclic Coordinate Dual Averaging with Extrapolation, Large-Scale Nonconvex Optimization: Randomization, Gap Estimation, and Numerical Resolution, Parameter estimation in a 3‐parameter p‐star random graph model, Block Policy Mirror Descent, Risk-averse optimization of reward-based coherent risk measures, A Bayesian-variational cyclic method for solving estimation problems characterized by non-uniqueness (equifinality), An inertial alternating minimization with Bregman distance for a class of nonconvex and nonsmooth problems, On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization, Robust supervised learning with coordinate gradient descent, Random Coordinate Descent Methods for Nonseparable Composite Optimization, Mixed-Response State-Space Model for Analyzing Multi-Dimensional Digital Phenotypes, Localization and approximations for distributed non-convex optimization, An introduction to continuous optimization for imaging, Iteration Complexity of a Block Coordinate Gradient Descent Method for Convex Optimization, The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem, A generic coordinate descent solver for non-smooth convex optimisation, Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity, Signal Decomposition Using Masked Proximal Operators
