Cyclic Coordinate Dual Averaging with Extrapolation

DOI10.1137/22m1470104arXiv2102.13244OpenAlexW4388263504MaRDI QIDQ6060151

Jelena Diakonikolas, Unnamed Author

Publication date: 3 November 2023

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.13244

zbMATH Keywords

variational inequalityextrapolationcyclic coordinate descent

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Parallel coordinate descent methods for big data optimization
• Universal gradient methods for convex optimization problems
• Iteration complexity analysis of block coordinate descent methods
• Dual extrapolation and its applications to solving variational inequalities and related problems
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Golden ratio algorithms for variational inequalities
• Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
• An adaptive primal-dual framework for nonsmooth convex minimization
• Coordinate descent algorithms
• Coordinate descent algorithms for lasso penalized regression
• Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
• Efficiency of the Accelerated Coordinate Descent Method on Structured Optimization Problems
• SparseNet: Coordinate Descent With Nonconvex Penalties
• Accelerated, Parallel, and Proximal Coordinate Descent
• An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization
• On Faster Convergence of Cyclic Block Coordinate Descent-type Methods for Strongly Convex Minimization
• The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods
• Stochastic Primal-Dual Coordinate Method for Regularized Empirical Risk Minimization
• A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions
• Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
• Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications
• A Primal-Dual Algorithm with Line Search for General Convex-Concave Saddle Point Problems
• Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method
• Unified Acceleration of High-Order Algorithms under General Hölder Continuity
• On the Convergence of Stochastic Primal-Dual Hybrid Gradient
• Simple and Optimal Methods for Stochastic Variational Inequalities, I: Operator Extrapolation
• Analyzing random permutations for cyclic coordinate descent
• A New Randomized Block-Coordinate Primal-Dual Proximal Algorithm for Distributed Optimization
• On the Nonasymptotic Convergence of Cyclic Coordinate Descent Methods
• Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications
• On the Convergence of Block Coordinate Descent Type Methods
• An Asynchronous Parallel Stochastic Coordinate Descent Algorithm
• Random permutations fix a worst case for cyclic coordinate descent
• A stochastic variance-reduced accelerated primal-dual method for finite-sum saddle-point problems

This page was built for publication: Cyclic Coordinate Dual Averaging with Extrapolation