2 citations · 2 across the 3 of their papers we have counts for
3 papers
math.NA2023
On the relaxed greedy randomized Kaczmarz methods with momentum acceleration for solving matrix equation AXB=C
Nian-Ci Wu, Yang Zhou, Zhaolu Tian
With the growth of data, it is more important than ever to develop an efficient and robust method for solving the consistent matrix equation AXB=C. The randomized Kaczmarz (RK) met…
cs.DS2022
Maximizing Modular plus Non-monotone Submodular Functions
Xin Sun, Chenchen Wu, Dachuan Xu +1
The research problem in this work is the relaxation of maximizing non-negative submodular plus modular with the entire real number domain as its value range over a family of down-c…
cs.DS2022★ 2 cited
An improved approximation algorithm for maximizing a DR-submodular function over a convex set
Donglei Du, Zhicheng Liu, Chenchen Wu +2
Maximizing a DR-submodular function subject to a general convex set is an NP-hard problem arising from many applications in combinatorial optimization and machine learning. While i…