arrow
Return

Randomized block coordinate DC algorithm

delete2025-11-26
delete0
delete
OA
AI
H
Hoomaan Maskan *
P
Paniz Halvachi
S
Suvrit Sra
A
Alp Yurtsever
DOI:10.1016/j.ejco.2025.100123delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
• Development of a novel variant of the difference of convex algorithm (DCA) that incorporates randomized CD updates. • Introduce a block coordinate Expectation Maximization (EM) method through the connection between DCA and the EM algorithm.
Keywords:
Difference of convex
Block coordinate methods
Nonconvex optimization
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

EURO Journal on Computational Optimization cover
EURO Journal on Computational Optimization
IF:
1.7
Papers:
42
Citations:
391

Organization

U
Umeå University
Scholars:
828
Papers: 385
Citations: 1
I
Independent Researcher
Scholars:
912
Papers: 791
Citations: 0
T
Technical University of Munich
Scholars:
5.2W
Papers: 3.9W
Citations: 6.2W
researcher View more organizations