2 papers
math.OC2026
Finding directional stationary points of DC programs
Hoai An Le Thi, Van Ngai Huynh, Tao Pham Dinh
We address the problem of computing stationary points for non-smooth, non-convex optimization problems. While this topic is well studied in the smooth setting, fewer algorithmic an…
math.OC2021
Online Stochastic DCA with applications to Principal Component Analysis
Hoai An Le Thi, Hoang Phuc Hau Luu, Tao Pham Dinh
Stochastic algorithms are well-known for their performance in the era of big data. In convex optimization, stochastic algorithms have been studied in depth and breadth. However, th…