数学
块(置换群论)
可分离空间
度量(数据仓库)
算法
最大化
坐标下降
趋同(经济学)
连接(主束)
正多边形
扩展(谓词逻辑)
收敛速度
凸优化
凸组合
计算机科学
坐标系
分数(化学)
数学优化
随机算法
凸集
集合(抽象数据类型)
凸函数
作者
Hoomaan Maskan,Paniz Halvachi,Suvrit Sra,Alp Yurtsever
标识
DOI:10.1016/j.ejco.2025.100123
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI