Coordinate Gradient Descent Algorithm

• Coordinate Gradient Descent (CGD) is a first-order optimization method that updates variables sequentially using partial gradients, ensuring efficiency in handling large-scale and structured problems.
• CGD exploits coordinate-wise smoothness and adaptive step-size rules to achieve fast convergence in convex and nonconvex settings while supporting parallel and asynchronous implementations.
• CGD has broad applications in machine learning and signal processing, with extensions such as block updates, privacy-enhanced variants, and hybrid schemes improving practical scalability.

Coordinate Gradient Descent (CGD) algorithms are a class of first-order optimization methods that update variables sequentially (or in blocks) along coordinate directions using (partial) gradient information. These algorithms, foundational in large-scale optimization, machine learning, and signal processing, exploit coordinate-wise or block-wise smoothness properties to enable computational efficiency, scalability, and parallelization, particularly for structured problems where computing or storing the full gradient is prohibitive or unnecessary.

1. Problem Formulations and Coordinate-Wise Regularity

Coordinate gradient descent is primarily used to solve unconstrained smooth or composite optimization problems of the form

$$\min_{x\in\mathbb{R}^n} f(x)\quad\text{or}\quad\min_{x\in\mathbb{R}^n} f(x) + \sum_{i=1}^n \Omega_i(x_i)$$

where $f$ is (block) coordinate-wise Lipschitz differentiable and the regularizer $\Omega_i$ is convex, possibly non-separable or non-differentiable (Wright, 2015, Chorobura et al., 2022, Fercoq et al., 2015).

The critical modeling assumption enabling efficient CGD is (block) coordinate-wise smoothness: for each coordinate $i$ and $t \in \mathbb{R}$

$$|\partial_i f(x + t e_i) - \partial_i f(x)| \leq L_i |t|$$

or, equivalently, for block $i$,

$$\|\nabla_i f(x + U_i h) - \nabla_i f(x)\| \leq L_i \|h\|$$

with $U_i$ the block selector (Chorobura et al., 2022). This property enables safe, aggressive per-coordinate step-length selection and facilitates the analysis of per-coordinate descent steps.

Coordinate gradient descent extends naturally to composite objectives with linear constraints, including non-separable regularizers or constraints, as in the coordinate-variant Vũ-Condat primal-dual algorithm (Fercoq et al., 2015), block-coordinate projected gradient for orthogonal NMF (Asadi et al., 2020), and constrained variants for SVM or TV-regularized imaging (Necoara et al., 2013, Fercoq et al., 2015).

2. Algorithmic Structure and Update Rules

Vanilla CGD (sometimes also called cyclic, randomized, or block coordinate descent) sequentially selects a coordinate (or block) and performs an update using the partial gradient. For smooth $f$, the generic step is

$f$0

with $f$1 a typical safe choice (Wright, 2015). For composite objectives

$f$2

Update scheduling can be cyclic, randomized (uniform or non-uniform), or accelerated. Variations include:

• Cyclic CD: Deterministic cycling through coordinates.
• Randomized CD: Uniform or importance sampling per iteration, with probabilistic convergence guarantees (Wright, 2015, Allen-Zhu et al., 2015).
• Block CD: Simultaneously updates several components or blocks; often used in constrained or matrix-factorization settings (Fercoq et al., 2015, Asadi et al., 2020).
• Hybrid variants: E.g., combining coordinate gradient steps and adaptive coordinate-wise line search as in hybrid CD for neural networks (Hsiao et al., 2024).

Advanced step-size selection is essential in nonconvex or nonseparable settings. For instance, in nonseparable composite scenarios, adaptive step-size rules are generated by solving coordinate-wise polynomial equations guaranteeing sufficient decrease, reflecting the local regularity of the nonseparable component (Chorobura et al., 2022).

Pseudocode for generic randomized CGD (with adaptive stepsizes):

$t \in \mathbb{R}$3

More sophisticated methods use coordinate selection combined with projection (for constraints), local second-order models, or line search. Implementation often maintains auxiliary variables (e.g., residuals) to efficiently update partial derivatives (Wright, 2015, Fercoq et al., 2015).

3. Convergence Theory and Complexity

Convex Objectives

For convex, (block) coordinate-wise smooth objectives and using appropriate step sizes ($f$3), CGD achieves sublinear rates: $f$4 where $f$5 is the problem dimension, $f$6, and $f$7 is the initial level-set diameter (Wright, 2015). Strongly convex problems yield linear convergence rates: $f$8 with $f$9 the strong convexity modulus (Wright, 2015).

Coordinate-wise step-size selection (importance sampling, $\Omega_i$0) can improve constants and even reduce $\Omega_i$1 to average $\Omega_i$2, while accelerated variants (ARCD, AAR-BCD, NuACDM) achieve $\Omega_i$3 and $\Omega_i$4 complexity respectively with further careful sampling ($\Omega_i$5) (Allen-Zhu et al., 2015, Diakonikolas et al., 2018).

Nonconvex Objectives and Saddle-Point Avoidance

For nonconvex problems, randomized CGD, under standard $\Omega_i$6 smoothness and nondegeneracy assumptions, almost surely avoids strict saddle points and converges to a local minimum (Chen et al., 11 Aug 2025, Chen et al., 2021, Bornstein et al., 2022). These results exploit the stochasticity of the coordinate selection and show that the set of trajectories converging to a strict saddle has zero measure, with escape rates governed by Lyapunov exponents of the associated random dynamical system.

For block-separable, nonconvex, or linearly constrained optimization, CGD ensures $\Omega_i$7 (randomized) or $\Omega_i$8 (cyclic) decay of minimum gradient norm, and $\Omega_i$9 or $i$0 suboptimality gaps under suitable step-size choices and composite structure (Chorobura et al., 2022, Chorobura et al., 1 Apr 2025, Wright, 2015).

Parallelization and Asynchrony

CGD supports parallelism via Jacobi (synchronous block updates) or lock-free asynchronous models. Performance scales near-linearly with processor count up to a threshold set by problem sparsity or coupling (Wright, 2015, Fercoq, 2013).

Table: Parallel Speedup Factors in Coordinate Gradient Descent

Method/Setting	Speedup Factor	Notes
RPCD, $i$1 procs	$i$2	$i$3 from ESO; near-linear until $i$4 (Fercoq, 2013)
Asynchronous CD	Sublinear in $i$5	Poly-logarithmic delay dependence; monotonic Hamiltonian ensures descent (Bornstein et al., 2022)

Here, $i$6 is max nonzeros per row, $i$7 is number of parallel processors.

4. Extensions and Practical Enhancements

Robust and Privacy-Enhanced Variants

Robust CGD combines per-coordinate updates with robust univariate gradient estimators (e.g., median-of-means) to handle heavy-tailed noise or outlier-corrupted data, maintaining $i$8 per cycle complexity and tight statistical guarantees (Gaïffas et al., 2022).

Differentially private SCD decouples coordinate updates, using mini-batching, per-coordinate clipping, and noise injection (in primal or dual) to achieve formal $i$9-DP, with overall optimization and privacy guarantees competitive with DP-SGD, while eliminating step-size tuning (Damaskinos et al., 2020).

Variable Screening and Coordinate Selection

Sophisticated coordinate screening rules, such as partial KKT tests and “strong rules,” adaptively select active variables to update (reducing unnecessary computation), as in exact CD for penalized Huber regression under high-dimensional settings (Kim et al., 15 Oct 2025). Empirically, this leads to substantial acceleration in sparsity-inducing models.

Block, Proximal, and Alternating CGD

CGD generalizes to block and primal-dual forms for problems with group structure, separability or coupled linear constraints, e.g., AR-BCD and AAR-BCD (Diakonikolas et al., 2018). For constrained matrix factorization, block-coordinate projected gradient or cyclic coordinate-projected gradient achieves efficient minimization, even in the presence of nonconvexity or orthogonality constraints (Asadi et al., 2020, Chorobura et al., 1 Apr 2025).

Anderson acceleration, applying nonlinear extrapolation to cyclic coordinate updates, yields substantial empirical speedup (3–5x or more) over classical or inertial CD and even matches or surpasses accelerated full-gradient methods in challenging regimes (Bertrand et al., 2020).

5. Applications in Machine Learning and Signal Processing

CGD and its variants are foundational in numerous large-scale problems:

• Empirical Risk Minimization: Lasso, Elastic Net, logistic regression, and least squares (Allen-Zhu et al., 2015, Bertrand et al., 2020).
• Boosting algorithms: Randomized parallel CGD for AdaBoost with exponential loss provably accelerates over greedier or classical CD approaches in large-scale regimes (Fercoq, 2013).
• Nonnegative Matrix Factorization: Block-coordinate PG or coordinate-projected GD efficiently handles orthogonality constraints essential for nonnegative representations (Asadi et al., 2020, Chorobura et al., 1 Apr 2025).
• Robust Regression: Exact coordinate minimization for penalized Huber loss leverages partial residualization and variable screening to efficiently solve large, ill-conditioned problems (Kim et al., 15 Oct 2025).
• Neural Networks: Hybrid CD combining line search and gradient steps accelerates the training of shallow networks, especially when leveraging parallelism (Hsiao et al., 2024).
• Privacy-Aware Learning: DP-SCD achieves differential privacy with minimal loss in accuracy compared to DP-SGD and essentially no additional tuning (Damaskinos et al., 2020).

6. Theoretical and Practical Trade-offs, Misconceptions

CGD offers compelling computational advantages for structured, high-dimensional, or constrained problems, but exhibits slower theoretical iteration complexities compared to (accelerated) full-gradient methods. However, the per-iteration cost is typically far lower: $t \in \mathbb{R}$0(coordinate size) versus $t \in \mathbb{R}$1(full dimension or batch size); in very large $t \in \mathbb{R}$2, CGD methods often outperform batch gradient approaches in time to solution (Wright, 2015, Fercoq, 2013).

Accelerated coordinate descent (e.g., via Nesterov, Anderson extrapolation, or momentum-based block updates) achieves optimal rates for both smooth and composite settings, yet the practical gains can depend sensitively on problem conditioning, data sparsity, and the efficiency of auxiliary operations (e.g., residuals, projections) (Bertrand et al., 2020, Allen-Zhu et al., 2015).

A misconception is that coordinate updates are inherently serial: both Jacobi (simultaneous) and asynchronous lock-free parallelism are provably convergent and scalable, with near-linear speedup up to a coupling threshold imposed by data structure (Wright, 2015, Bornstein et al., 2022, Fercoq, 2013).

Hybrid update schemes (switching between gradient and line search steps per-coordinate) can further mitigate local plateaus or nonconvexity, especially in overparameterized settings, such as neural networks (Hsiao et al., 2024).

7. Best Practices and Implementation Considerations

Efficient CGD implementations use:

• Precomputation and lazy updates for partial derivatives (especially in sparse problems) (Wright, 2015).
• Adaptive or coordinate-specific step-size rules, possibly informed by problem structure or polytopic bounds, to ensure monotonic decrease and aggressive progress (Chorobura et al., 2022, Chorobura et al., 1 Apr 2025).
• Variable screening and safe/strong rules to focus computation and exploit sparsity (Kim et al., 15 Oct 2025).
• Parallel or asynchronous coordination, with careful handling of delayed/stale reads for consistency and convergence (Bornstein et al., 2022, Fercoq, 2013).
• Robust estimators or privacy-preserving devices as required by statistical guarantees (Gaïffas et al., 2022, Damaskinos et al., 2020).

CGD delivers a flexible, theoretically grounded, and extensively validated solution paradigm for modern large-scale, structured, or constrained optimization tasks across multiple scientific domains.