On the Convergence of Block Coordinate Descent Type Methods

From MaRDI portal
Revision as of 02:01, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5408210

DOI10.1137/120887679zbMath1297.90113OpenAlexW2023901033MaRDI QIDQ5408210

Amir Beck, Luba Tetruashvili

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




Related Items (only showing first 100 items - show all)

Parallel block coordinate minimization with application to group regularized regressionAdditive Schwarz methods for convex optimization with backtrackingBlock Bregman Majorization Minimization with ExtrapolationA mean field game model for the evolution of citiesAn attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problemsNewton-type multilevel optimization methodOn the rate of convergence of the proximal alternating linearized minimization algorithm for convex problemsBlock-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problemsParallel random block-coordinate forward-backward algorithm: a unified convergence analysisThe Cyclic Block Conditional Gradient Method for Convex Optimization ProblemsAn accelerated coordinate gradient descent algorithm for non-separable composite optimizationAn Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk MinimizationDecomposition Methods for Sparse Matrix Nearness ProblemsMAGMA: Multilevel Accelerated Gradient Mirror Descent Algorithm for Large-Scale Convex Composite MinimizationA proximal block minimization method of multipliers with a substitution procedureParallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error BoundsA variational method for Abel inversion tomography with mixed Poisson-Laplace-Gaussian noiseInertial alternating direction method of multipliers for non-convex non-smooth optimizationUnnamed ItemActive-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line SearchOn the Linear Convergence of the Multimarginal Sinkhorn AlgorithmRandom block coordinate descent methods for linearly constrained optimization over networksBlock layer decomposition schemes for training deep neural networksDistributed constraint-coupled optimization via primal decomposition over random time-varying graphsA globally convergent algorithm for nonconvex optimization based on block coordinate updateBlock Stochastic Gradient Iteration for Convex and Nonconvex OptimizationslimTrain---A Stochastic Approximation Method for Training Separable Deep Neural NetworksA block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applicationsCyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and ApplicationsAccelerating block coordinate descent methods with identification strategiesEmpirical risk minimization: probabilistic complexity and stepsize strategyAn almost cyclic 2-coordinate descent method for singly linearly constrained problemsProximal alternating linearized minimization for nonconvex and nonsmooth problemsRandomness and permutations in coordinate descent methodsAsynchronous Stochastic Coordinate Descent: Parallelism and Convergence PropertiesStochastic Block Mirror Descent Methods for Nonsmooth and Stochastic OptimizationSubspace correction methods in algebraic multi-level framesRandomized Block Proximal Damped Newton Method for Composite Self-Concordant MinimizationOn the Efficiency of Random Permutation for ADMM and Coordinate DescentConvergence of slice-based block coordinate descent algorithm for convolutional sparse codingUnnamed ItemAnalysis of the Block Coordinate Descent Method for Linear Ill-Posed ProblemsFast Nonoverlapping Block Jacobi Method for the Dual Rudin--Osher--Fatemi ModelAdditive Schwarz Methods for Convex Optimization as Gradient MethodsIncremental Majorization-Minimization Optimization with Application to Large-Scale Machine LearningAnalyzing random permutations for cyclic coordinate descentConvergence analysis of the Fast Subspace Descent method for convex optimization problemsSynchronous parallel block coordinate descent method for nonsmooth convex function minimizationBregman Itoh-Abe methods for sparse optimisationA spatial Pareto exchange economy problemAccelerated alternating descent methods for Dykstra-like problemsExtended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insightsA random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraintsThe 2-coordinate descent method for solving double-sided simplex constrained minimization problemsRegularization of inverse problems via time discrete geodesics in image spacesWorst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized versionDistributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra SplittingColumn-oriented algebraic iterative methods for nonnegative constrained least squares problemsA Randomized Coordinate Descent Method with Volume SamplingOn the complexity analysis of randomized block-coordinate descent methodsThe Analysis of Alternating Minimization Method for Double Sparsity Constrained Optimization ProblemOutlier detection in networks with missing linksA Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable FunctionsUnnamed ItemGAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regressionOn Faster Convergence of Cyclic Block Coordinate Descent-type Methods for Strongly Convex MinimizationIteration complexity analysis of block coordinate descent methodsSchwarz iterative methods: infinite space splittings3D joint hydrogeophysical inversion using similarity measuresError bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGMRate of convergence analysis of dual-based variables decomposition methods for strongly convex problemsConvergent inexact penalty decomposition methods for cardinality-constrained problemsA parallel line search subspace correction method for composite convex optimizationAn Efficient Inexact ABCD Method for Least Squares Semidefinite ProgrammingMulti-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorizationA block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorizationAccelerating Nonnegative Matrix Factorization Algorithms Using ExtrapolationA remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functionsMarkov chain block coordinate descentRandomized Gradient Boosting MachineA Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex OptimizationT-product factorization method for internet traffic data completion with spatio-temporal regularizationA Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problemsCoordinate descent with arbitrary sampling II: expected separable overapproximationAlternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized ProblemsA fundamental proof of convergence of alternating direction method of multipliers for weakly convex optimizationVariational Image Regularization with Euler's Elastica Using a Discrete Gradient SchemeAn alternating minimization method for robust principal component analysisAn alternating algorithm for finding linear Arrow-Debreu market equilibriaDykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functionsFast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization AlgorithmsComputing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative ConeRisk-averse policy optimization via risk-neutral policy optimizationCyclic coordinate descent in the Hölder smooth settingCuriosities and counterexamples in smooth convex optimizationOn complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimizationUnnamed ItemUnnamed ItemOn the convergence of a block-coordinate incremental gradient methodOn the rate of convergence of alternating minimization for non-smooth non-strongly convex optimization in Banach spaces







This page was built for publication: On the Convergence of Block Coordinate Descent Type Methods