On the Nonasymptotic Convergence of Cyclic Coordinate Descent Methods
From MaRDI portal
Publication:5300539
DOI10.1137/110840054zbMATH Open1270.90032OpenAlexW1974524469MaRDI QIDQ5300539FDOQ5300539
Authors: Ankan Saha, Ambuj Tewari 
Publication date: 27 June 2013
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/110840054
Recommendations
- On the iteration complexity of cyclic coordinate gradient descent methods
- On faster convergence of cyclic block coordinate descent-type methods for strongly convex minimization
- scientific article; zbMATH DE number 3905760
- Cyclic coordinate descent in the Hölder smooth setting
- Cyclic coordinate descent in a class of bang-singular-bang problems
- On the convergence of the coordinate descent method for convex differentiable minimization
- On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization
- Convergence of a block coordinate descent method for nondifferentiable minimization
- An almost cyclic 2-coordinate descent method for singly linearly constrained problems
- A cyclic block coordinate descent method with generalized gradient projections
Cited In (39)
- Parallel coordinate descent methods for big data optimization
- Inexact coordinate descent: complexity and preconditioning
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
- Title not available (Why is that?)
- On the iteration complexity of cyclic coordinate gradient descent methods
- On faster convergence of cyclic block coordinate descent-type methods for strongly convex minimization
- The cyclic block conditional gradient method for convex optimization problems
- A knowledge-supported improvement of the PSO method
- An accelerated randomized proximal coordinate gradient method and its application to regularized empirical risk minimization
- Asynchronous stochastic coordinate descent: parallelism and convergence properties
- A cyclic block coordinate descent method with generalized gradient projections
- Block stochastic gradient iteration for convex and nonconvex optimization
- Cyclic coordinate-update algorithms for fixed-point problems: analysis and applications
- An efficient inexact ABCD method for least squares semidefinite programming
- Cyclic Coordinate Dual Averaging with Extrapolation
- Local linear convergence of proximal coordinate descent algorithm
- Iteration complexity of a block coordinate gradient descent method for convex optimization
- On the complexity analysis of randomized block-coordinate descent methods
- Parallel block coordinate minimization with application to group regularized regression
- Convergence of incentive-driven dynamics in Fisher markets
- Block-cyclic stochastic coordinate descent for deep neural networks
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- PolyCD: optimization via cycling through the vertices of a polytope
- Title not available (Why is that?)
- Addressing imbalanced insurance data through zero-inflated Poisson regression with boosting
- An inexact gradient mirror descent algorithm for non-smooth convex optimization
- A block successive upper-bound minimization method of multipliers for linearly constrained convex optimization
- Iteration complexity analysis of block coordinate descent methods
- A systematic approach for learning imbalanced data: enhancing zero-inflated models through boosting
- Analysis of the Block Coordinate Descent Method for Linear Ill-Posed Problems
- On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization
- Alternating minimization methods for strongly convex optimization
- Dual block-coordinate forward-backward algorithm with application to deconvolution and deinterlacing of video sequences
- Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version
- Empirical risk minimization: probabilistic complexity and stepsize strategy
- An almost cyclic 2-coordinate descent method for singly linearly constrained problems
- Randomness and permutations in coordinate descent methods
- On the complexity of parallel coordinate descent
- Distributed block coordinate descent for minimizing partially separable functions
This page was built for publication: On the Nonasymptotic Convergence of Cyclic Coordinate Descent Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300539)
