3 citations · 3 across the 4 of their papers we have counts for
4 papers
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…
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…
Stochastic Difference-of-Convex Algorithms for Solving nonconvex optimization problems
Le Thi Hoai An, Huynh Van Ngai, Pham Dinh Tao +1
The paper deals with stochastic difference-of-convex functions (DC) programs, that is, optimization problems whose the cost function is a sum of a lower semicontinuous DC function…
DC approximation approaches for sparse optimization
Hoai An Le Thi, Tao Pham Dinh, Hoai Minh Le +1
Sparse optimization refers to an optimization problem involving the zero-norm in objective or constraints. In this paper, nonconvex approximation approaches for sparse optimization…