arbiter
JournalsPricingAccount

Randomized block coordinate DC algorithm

Hoomaan Maskan et al.

EURO Journal on Computational Optimization2025https://doi.org/10.1016/j.ejco.2025.100123article
AJG 2
Weight
0.50

What the paper says

We introduce an extension of the Difference of Convex Algorithm (DCA) in the form of a randomized block coordinate approach for problems with separable structure. For n coordinate-blocks and k iterations, our main result proves a non-asymptotic convergence rate of O(n/k) in expectation, with respect to a stationarity measure based on a Forward-Backward envelope. Furthermore, leveraging the connection between DCA and Expectation Maximization (EM), we propose a randomized block coordinate EM algorithm.

Open paper page →

Cite this paper

https://doi.org/https://doi.org/10.1016/j.ejco.2025.100123

Or copy a formatted citation

@article{hoomaan2025,
  title        = {{Randomized block coordinate DC algorithm}},
  author       = {Hoomaan Maskan et al.},
  journal      = {EURO Journal on Computational Optimization},
  year         = {2025},
  doi          = {https://doi.org/https://doi.org/10.1016/j.ejco.2025.100123},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

Randomized block coordinate DC algorithm

Flags are reviewed by the Arbiter methodology team within 5 business days.

Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.