Danqing Zhou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Danqing Zhou has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Junfeng Yang
School of Mathematics, Nanjing University, Nanjing, China
2 shared publications - Hongmei Chen
School of Mathematical Sciences Sichuan Normal University Chengdu P. R. China
1 shared publication - Shiqian Ma
Department of Computational Applied Mathematics and Operations Research, Rice University, Houston, Texas 77005
1 shared publication - Yong-Jin Liu
School of Mathematics and Statistics, Fuzhou University, Fuzhou, P.R. China
1 shared publication
Latest Publications
- 10 September 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 109 (2) , 44
Inexact Golden Ratio Primal-Dual Algorithms for Structured Convex Optimization Problems
- 10 September 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 109 (2) , 44
Inexact Golden Ratio Primal-Dual Algorithms for Structured Convex Optimization Problems
- Open Access
On the Convergence of Constrained Gradient Method
The constrained gradient method (CGM) has recently been proposed to solve convex optimization and monotone variational inequality (VI) problems with general functional constraints. While existing literature has established convergence results for CGM, the assumptions employed therein are quite restrictive; in some cases, certain assumptions are mutually inconsistent, leading to gaps in the underlying analysis. This paper aims to derive rigorous and improved convergence guarantees for CGM under weaker and more reasonable assumptions, specifically in the context of strongly convex optimization and strongly monotone VI problems. Preliminary numerical experiments are provided to verify the validity of CGM and demonstrate its efficacy in addressing such problems.
Open AccessOn the Convergence of Constrained Gradient Method
The constrained gradient method (CGM) has recently been proposed to solve convex optimization and monotone variational inequality (VI) problems with general functional constraints. While existing literature has established convergence results for CGM, the assumptions employed therein are quite restrictive; in some cases, certain assumptions are mutually inconsistent, leading to gaps in the underlying analysis. This paper aims to derive rigorous and improved convergence guarantees for CGM under weaker and more reasonable assumptions, specifically in the context of strongly convex optimization and strongly monotone VI problems. Preliminary numerical experiments are provided to verify the validity of CGM and demonstrate its efficacy in addressing such problems.