7 citations · 9 across the 2 of their papers we have counts for
2 papers
math.OC2026★ 2 cited
Fast Gradient Algorithm with Dry-like Friction and Nonmonotone Line Search for Nonconvex Optimization Problems
Lien T. Nguyen, Andrew Eberhard, Xinghuo Yu +1
In this paper, we propose a fast gradient algorithm for the problem of minimizing a differentiable (possibly nonconvex) function in Hilbert spaces. We first extend the dry friction…
math.OC2024★ 7 cited
Bregman Proximal Linearized ADMM for Minimizing Separable Sums Coupled by a Difference of Functions
Tan Nhat Pham, Minh N. Dao, Andrew Eberhard +1
In this paper, we develop a splitting algorithm incorporating Bregman distances to solve a broad class of linearly constrained composite optimization problems, whose objective func…